scientific article; zbMATH DE number 3894472
From MaRDI portal
zbMath0561.68034MaRDI QIDQ5186732
Savelsbergh, Martin W. P., Peter van Emde Boas
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items
On the solvability of domino snake problems, On simple and creative sets in NP, A multiparameter analysis of domino tiling with an application to concurrent systems, Turing machines with access to history, On timeline-based games and their complexity, Domino-tiling games, Complexity analysis of propositional concurrent programs using domino tiling
