Assembling molecules in ATOMIX is hard (Q1885003): Difference between revisions

From MaRDI portal
Changed an 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.1016/j.tcs.2002.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010582226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOKOBAN and other motion planning problems / 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: Hierarchies of complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((n^ 2-1)\)-puzzle and related relocation problems / rank
 
Normal rank

Latest revision as of 14:52, 7 June 2024

scientific article
Language Label Description Also known as
English
Assembling molecules in ATOMIX is hard
scientific article

    Statements

    Assembling molecules in ATOMIX is hard (English)
    0 references
    0 references
    0 references
    27 October 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Finite automata
    0 references
    Intersection emptiness
    0 references
    Block sliding puzzle
    0 references
    PSPACE-completeness
    0 references
    0 references
    0 references