scientific article; zbMATH DE number 7765391
From MaRDI portal
Publication:6065436
DOI10.4230/lipics.isaac.2020.33arXiv2011.00968MaRDI QIDQ6065436
Unnamed Author, Tom C. van der Zanden, Marc J. van Kreveld, Yushi Uno
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/2011.00968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityHamiltonian cycledivide-and-conquerpuzzle game(combinatorial) reconfigurationsliding-block puzzle
Cites Work
- Unnamed Item
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- XSAT and NAE-SAT of linear CNF classes
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
- Randomized and Approximation Algorithms for Blue-Red Matching
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
This page was built for publication:
