A tight lower bound for the complexity of path-planning for a disc

Authors:
Colm O'Dunlaing
Affiliations:
-
Venue:
Information Processing Letters
Year:
1988

Citing 0
Cited 1

Decision trees: old and new results

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

Abstract