Galois connections for patterns: an algebra of labelled graphs (Q2044173): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4993594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532570 / 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 finer reduction of constraint problems to digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On singleton arc consistency for CSPs defined by monotone patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability in constraint satisfaction problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tractability of CSP Classes Defined by Forbidden Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binarisation for Valued Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary constraint satisfaction problems defined by excluded topological minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising tractable constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid tractability of valued constraint problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Tractable Classes of Constraint Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4600768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / 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: A sufficient condition for backtrack-bounded search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain permutation reduction for constraint satisfaction problems / 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: 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: Tractable constraints on ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4597893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden lifts (NP and CSP for combinatorialists) / 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: A strong Mal'cev condition for locally finite varieties omitting the unary type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank

Latest revision as of 07:35, 26 July 2024

scientific article
Language Label Description Also known as
English
Galois connections for patterns: an algebra of labelled graphs
scientific article

    Statements

    Galois connections for patterns: an algebra of labelled graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    constraint satisfaction
    0 references
    tractability
    0 references
    forbidden patterns
    0 references
    Galois connection
    0 references
    lattices
    0 references
    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