On the complexity of reconfiguration problems (Q631762): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Martha Sideris / rank
Normal rank
 
Property / author
 
Property / author: Martha Sideris / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q115940836 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997048861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Reconfiguration Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of partitioning graphs with supply and demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of List Edge-Colorings in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTITIONING TREES OF SUPPLY AND DEMAND / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / 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
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:35, 3 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of reconfiguration problems
scientific article

    Statements

    On the complexity of reconfiguration problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation
    0 references
    graph algorithm
    0 references
    PSPACE-complete
    0 references
    reachability on solution space
    0 references
    reconfiguration problems
    0 references
    0 references
    0 references