Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1404.3801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flip distance between triangulations of a simple polygon is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rings of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoloring graphs via tree decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of the graph of vertex-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some tree similarity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: γ-graphs of graphs / 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: On the complexity of reconfiguration problems / 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: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover Reconfiguration and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3194807 / rank
 
Normal rank

Latest revision as of 22:49, 10 July 2024

scientific article
Language Label Description Also known as
English
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
scientific article

    Statements

    Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2015
    0 references

    Identifiers