Conservative constraint satisfaction re-revisited (Q896026): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / 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: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Majority-Minority Operations are Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / 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: ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Learnability Arising from Algebras with Few Subpowers / 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: Algorithmic complexity of list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Revision as of 04:29, 11 July 2024

scientific article
Language Label Description Also known as
English
Conservative constraint satisfaction re-revisited
scientific article

    Statements

    Conservative constraint satisfaction re-revisited (English)
    0 references
    0 references
    11 December 2015
    0 references
    constraint satisfaction problem
    0 references
    complexity
    0 references
    dichotomy
    0 references
    algebraic approach
    0 references

    Identifiers