Hearn, Robert A.

1. PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation
   2002/05/04 by Robert A. Hearn, Hearn, Robert A., Erik D. Demaine +1 · 7 citations
   Computer Science · #Artificial Intelligence in Games #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #Computer Science and Game Theory (cs.GT) #F.1 #F.2.2 #FOS: Computer and information sciences #Image Processing and 3D Reconstruction #cs.CC #cs.GT
2. Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
   2001/06/11 by Demaine, Erik D., Hearn, Robert A. · 1 citation
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.1.3 #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1
3. Two-Disk Compound Symmetry Groups
   2023/02/25 by Robert A. Hearn, Hearn, Robert A., William Kretschmer +7 · 1 voice
   Physics and Astronomy · #Advanced Mathematical Theories and Applications #cs.CG #math.GR #math.MG
4. PSPACE-Completeness of Reversible Deterministic Systems
   2022/07/14 by Demaine, Erik D., Hearn, Robert A., Hendrickson, Dylan +1 · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences