Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper
Query: Rush Hour is PSPACE-complete
PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation
A Simple , but NP-Hard , Motion Planning Problem
Some simplified NP-complete problems
A Mechanical Proof of the Unsolvability of the Halting Problem
The Planar Hamiltonian Circuit Problem is NP-Complete
Linear-time computability of combinatorial problems on series-parallel graphs
Computational complexity and an integer programming model of Shakashaka
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Gaining efficiency and flexibility in the simple temporal problem
Classifying Problems into Complexity Classes
Algebrization: a new barrier in complexity theory
Sequencing and scheduling : algorithms and complexity
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
Directional Resolution: The Davis-Putnam Procedure, Revisited
A Short History of Computational Complexity
Computability Theory of Closed Timelike Curves
The status of the P versus NP problem
Why are some problems hard? Evidence from Tower of Hanoi
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
Computers And Intractability A Guide To The Theory Of Np Completeness
Fluoxetine for motor recovery after acute ischaemic stroke (FLAME): a randomised placebo-controlled trial
WHAT O DO ( AND NOT TO DO ) WITH TIME-SERIES CROSS-SECTION DATA
Assistive robot operated via P300-based Brain Computer Interface
Hybridization of MOFs and polymers