Generalized Pete's Pike is PSPACE-complete (Q899314): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.11.036 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Randolphs Robot Game is NP-hard! / 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: Q4435431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assembling molecules in ATOMIX is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797430 / 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: Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4--6, 2012. Proceedings / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.11.036 / rank
 
Normal rank

Latest revision as of 07:47, 10 December 2024

scientific article
Language Label Description Also known as
English
Generalized Pete's Pike is PSPACE-complete
scientific article

    Statements

    Identifiers