Computational complexity of puzzles and related topics
From MaRDI portal
Publication:6535387
Recommendations
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3468692 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1944412 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- Algorithms for solving Rubik's cubes
- Alternation
- Complexity of independent set reconfigurability problems
- Complexity results for standard benchmark domains in planning
- Computational complexity of jumping block puzzles
- Games, puzzles, and computation
- HIROIMONO Is NP-Complete
- Handbook of satisfiability. In 2 parts
- Hard tiling problems with simple tiles
- Hashiwokakero is NP-complete
- Herugolf and Makaro are NP-complete
- Hexaflexagons, probability paradoxes, and the Tower of Hanoi. Martin Gardner's first book of mathematical puzzles and games
- Introduction to reconfiguration
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- Knots and Borromean rings, rep-tiles, and eight queens.
- Linear-time algorithm for sliding tokens on trees
- Movement Problems for 2-Dimensional Linkages
- NP-completeness of two pencil puzzles: Yajilin and Country Road
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On alternation
- On alternation. II. A graph theoretic approach to determinism versus nondeterminism
- On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game
- On the complexity of reconfiguration problems
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reducibility among combinatorial problems
- SOKOBAN and other motion planning problems
- Shikaku and Ripple Effect are NP-complete
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- Shortest reconfiguration sequence for sliding tokens on spiders
- Sliding token on bipartite permutation graphs
- Sliding tokens on a cactus
- Sliding tokens on block graphs
- Solving the Rubik's Cube Optimally is NP-complete
- Tatamibari is NP-complete
- The Complexity of Solitaire
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- The Othello game on an \(n\times n\) board is PSPACE-complete
- The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake
- The \((n^ 2-1)\)-puzzle and related relocation problems
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Generating all combinations and partitions. Fasc. 4: Generating all trees. History of combinatorial generation.
- The complexity of change
- The complexity of theorem-proving procedures
Cited in
(2)
This page was built for publication: Computational complexity of puzzles and related topics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535387)
