External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm

Michèle Dion, Marc Gengler, Stéphane Ubéda. Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm. In Bruno Buchberger, Jens Volkert, editors, Parallel Processing: CONPAR 94 - VAPP VI, Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994, Proceedings. Volume 854 of Lecture Notes in Computer Science, pages 359-370, Springer, 1994.

Abstract

Abstract is missing.

runs on