On Paths in Search or Decision Trees Which Require Almost Worst-Case Time - researchr publication

researchr

You are not signed in
Sign in
Sign up

Ulrich Huckenbeck. On Paths in Search or Decision Trees Which Require Almost Worst-Case Time. In Jan van Leeuwen, editor, Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG 88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings. Volume 344 of Lecture Notes in Computer Science, pages 406-423, Springer, 1988.

Abstract is missing.

runs on WebDSL