Strong partial clones and the time complexity of SAT problems (Q340559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On some closed classes in partial two-valued logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-dichotomies in Constraint Satisfaction Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basics of Galois Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-SAT Faster and Simpler---Unique-SAT Bounds for PPSZ Hold in General / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard constraint satisfaction problems have hard gaps at location 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak bases of Boolean co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Algebras on Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard tiling problems with simple tiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full derandomization of schöning's k-SAT algorithm / 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 algebras of partial functions and their invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Limits of Sparsification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy on intervals of strong partial Boolean clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low and a high hierarchy within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition into Triangles on Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 22:22, 12 July 2024

scientific article
Language Label Description Also known as
English
Strong partial clones and the time complexity of SAT problems
scientific article

    Statements

    Strong partial clones and the time complexity of SAT problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2016
    0 references
    satisfiability problems
    0 references
    computational complexity
    0 references
    clone theory
    0 references
    universal algebra
    0 references
    subexponential time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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