A framework for proving the computational intractability of motion planning problems
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020
Main Author: | Lynch, Jayson(Jayson R.) |
---|---|
Other Authors: | Erik D. Demaine. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/129205 |
Similar Items
-
On the computational complexity of portal and push-pull block puzzles
by: Lynch, Jayson (Jayson R.)
Published: (2016) -
Underwater sound puluse generator
by: Strayer, Jayson D. (Jayson Dee)
Published: (2008) -
Using simulation techniques to prove timing properties
by: Luchangco, Victor
Published: (2007) -
Theorem-proving distributed algorithms with dynamic analysis
by: Ne Win, Toh, 1979-
Published: (2006) -
A computational framework for understanding problems in stereo vision
by: Gennert, Michael Andrew
Published: (2005)