The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-015-9663-z / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2787312740 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.6679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution-space geometry of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On connected Boolean functions / 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: Q3194807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure identification of Boolean relations and plain bases for co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / 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: 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: Shortest Paths between Shortest Paths and Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability problems for propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Boolean Connectivity Problem for Horn Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at survey propagation and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the applicability of Post's lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating All Solutions for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-015-9663-Z / rank
 
Normal rank

Latest revision as of 11:40, 18 December 2024

scientific article
Language Label Description Also known as
English
The connectivity of Boolean satisfiability: dichotomies for formulas and circuits
scientific article

    Statements

    The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (English)
    0 references
    20 October 2017
    0 references
    Boolean satisfiability
    0 references
    Boolean circuits
    0 references
    Post's lattice
    0 references
    PSPACE-completeness
    0 references
    dichotomy theorems
    0 references
    graph connectivity
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references