Login / Signup
Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets.
Joshua Ani
Jeffrey Bosboom
Erik D. Demaine
Yevhenii Diomidov
Dylan H. Hendrickson
Jayson Lynch
Published in:
CoRR (2020)
Keyphrases
</>
temporal logic
random instances
planar surfaces
computational complexity
information theoretic
multi modal
mazurkiewicz traces
np complete
worst case
upper bound
np hard
computer vision
satisfiability problem
humanoid robot
learning algorithm
neural network
data sets