A tight lower bound for the complexity of path-planning for a disc.
We couldn't estimate the reading time for this book.
Author
Publication
1986 - Courant Institute of Mathematical Sciences, New York University, New York, New York (State)
Language
English
Word Count
0 words, Guess
Page Count
0 pages
Identifiers
- Internet Archivetightlowerboundf00odun
- Open LibraryOL17979017M
Subjects
Series Statement
- Robotics report -- 75
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!