Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' (Q5958338): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56385393, #quickstatements; #temporary_batch_1706814575051
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible simulation of space-bounded computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible space equals deterministic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bennett’s Time-Space Tradeoff for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversibility and adiabatic computation: trading time and space for energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((n^ 2-1)\)-puzzle and related relocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886867 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00173-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032056620 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article; zbMATH DE number 1715339
Language Label Description Also known as
English
Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants''
scientific article; zbMATH DE number 1715339

    Statements

    Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' (English)
    0 references
    0 references
    0 references
    3 March 2002
    0 references
    games
    0 references
    PSPACE-completeness
    0 references
    reversible logic
    0 references
    motion planning
    0 references
    dual-rail logic
    0 references

    Identifiers