
On the complexity of branch-and-bound search for random trees
Luc Devroye, Carlos Zamora-CuraVolume:
14
Année:
1999
Langue:
english
Pages:
19
DOI:
10.1002/(sici)1098-2418(199907)14:43.0.co;2-1
Fichier:
PDF, 256 KB
english, 1999