Rush Hour is PSPACE-complete, or "why you should generously tip parking lot attendants"

Theoretical Computer Science

Volumn 270, Issue 1-2, 2002, Pages 895-911

  Flake, Gary William ^a   Baum, Eric B ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

Dual rail logic; Games; Motion planning; PSPACE completeness; Reversible logic

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; FORMAL LOGIC; MOTION PLANNING;

LOGICAL COMBINATIONS; REVERSIBLE LOGIC;

GAME THEORY;

EID: 0037028456     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00173-6     Document Type: Article

References (22)

1. Logical reversibility of computation
2. Time/space trade-offs for reversible computation
3. Reversible simulation of space-bounded computation
4. Sokoban is pspace-complete
5. Efficient self-timing with level-encoded 2-phase dual-rail (LEDR)
6. Physically-motivated models of computation for complexity theory
7. Separations of reversible and irreversible space-time complexity classes, extended abstract
8. On the complexity of motion planning for multiple independent objects; pspace-hardness of the "warehouseman's problem"
9. Reversible space equals deterministic space
10. A note on Bennett's time-space tradeoff for reversible computation
11. Reversible simulation of irreversible computation by pebble games
12. Reversibility and adiabatic computation trading time and space for energy
13. Two types of mechanical reversible logic
14. Helical logic
15. Motion planning on a graph
16. Finding a shortest solution for the (n×n)-extension of the 15-puzzle is intractable
17. Complexity of the mover's problem and generalizations
18. Reversible computing
19. Reversible computing