Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2605361762 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1610.09574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems Solvable by Local Consistency Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of unfrozen problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411838 / 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: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all solutions of generalized satisfiability problems / 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: Frozen development in graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LATTICE OF ALTER EGOS / 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: Q5459443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and polymorphisms for digraph constraint problems under some basic constructions / 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: Constraints, consistency and closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints and universal algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal algebra and hardness results for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / 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: 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: Dichotomy on intervals of strong partial Boolean clones / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:39, 13 July 2024

scientific article
Language Label Description Also known as
English
Gap theorems for robust satisfiability: Boolean CSPs and beyond
scientific article

    Statements

    Gap theorems for robust satisfiability: Boolean CSPs and beyond (English)
    0 references
    0 references
    11 May 2017
    0 references
    constraint satisfaction problem
    0 references
    robust satisfiability
    0 references
    clone theory
    0 references
    dichotomy
    0 references
    trichotomy
    0 references
    Boolean
    0 references
    0 references
    0 references

    Identifiers

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