Games, Puzzles and Treewidth (Q5042461): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-42071-0_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3017814938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classic Nintendo games are (computationally) hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of path-forming games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Time Algorithms for Embedding H-Minor Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bounds for Graph Embedding Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Complexity of Polyomino Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Portal and Other 3D Video Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Two-Dimensional Platform Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a perfect strategy for nxn chess requires time exponential in n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Othello game on an \(n\times n\) board is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3-SAT with a clause/variable cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Graph Constraint Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-Completeness of Bloxorz and of Games with 2-Buttons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaming is a hard job, but someone has to do it! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration in bounded bandwidth and tree-depth / rank
 
Normal rank

Latest revision as of 13:58, 30 July 2024

scientific article; zbMATH DE number 7604216
Language Label Description Also known as
English
Games, Puzzles and Treewidth
scientific article; zbMATH DE number 7604216

    Statements

    Games, Puzzles and Treewidth (English)
    0 references
    19 October 2022
    0 references
    complexity
    0 references
    games
    0 references
    puzzles
    0 references
    treewidth
    0 references

    Identifiers