Average-Case Bounds for the Complexity of Path-Search
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
doi 10.1090/dimacs/042/01
Full Text
Open PDFAbstract
Available in full text
Date
May 5, 1998
Authors
Publisher
American Mathematical Society