Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Time Complexity of Constraint Satisfaction via Universal Algebra
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.MFCS.2017.17 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1706.05902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Give Me Another One! / rank
 
Normal rank
Property / cites work
 
Property / cites work: As Close as It Gets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Phylogeny Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of temporal constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schaefer's Theorem for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389338 / 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: Complexity Classifications for Logic-Based Argumentation / 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: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Tractable Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap theorems for robust satisfiability: Boolean CSPs and beyond / 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: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong partial clones and the time complexity of SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Complexity of Constraint Satisfaction via Universal Algebra / 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: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Polymorphisms and Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2705838778 / rank
 
Normal rank
Property / title
 
Time Complexity of Constraint Satisfaction via Universal Algebra (English)
Property / title: Time Complexity of Constraint Satisfaction via Universal Algebra (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.MFCS.2017.17 / rank
 
Normal rank

Latest revision as of 15:58, 30 December 2024

scientific article; zbMATH DE number 7204351
Language Label Description Also known as
English
Time Complexity of Constraint Satisfaction via Universal Algebra
scientific article; zbMATH DE number 7204351

    Statements

    0 references
    0 references
    0 references
    26 May 2020
    0 references
    clone theory
    0 references
    universal algebra
    0 references
    constraint satisfaction problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Time Complexity of Constraint Satisfaction via Universal Algebra (English)
    0 references

    Identifiers

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