Q3305736 (Q3305736): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Classic Nintendo games are (computationally) hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushing blocks is hard. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Push-Pull Block Puzzles are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super Mario Bros. Is Harder/Easier than We Thought / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{Pull} and \textsc{PushPull} are PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Revision as of 06:00, 23 July 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references