Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The complexity of satisfiability problems: Refining Schaefer's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Colouring by Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely related algebras in congruence modular varieties have few subpowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems of Bounded Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem / 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: Q3093852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties with few subalgebras of powers / 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: Q4035684 / 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: The structure of finite algebras / 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: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras Whose Congruence Lattices are Distributive. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maltsev digraphs have a majority polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shape of congruence lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterisation of First-Order Constraint Satisfaction Problems / 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: Weak near-unanimity functions and digraph homomorphism problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributivity and Permutability of Congruence Relations in Equational Classes of Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963009602 / rank
 
Normal rank

Latest revision as of 09:32, 30 July 2024

scientific article; zbMATH DE number 6663544
Language Label Description Also known as
English
Complexity and polymorphisms for digraph constraint problems under some basic constructions
scientific article; zbMATH DE number 6663544

    Statements

    Complexity and polymorphisms for digraph constraint problems under some basic constructions (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2016
    0 references
    polymorphism
    0 references
    directed graph
    0 references
    one point extension
    0 references
    constraint satisfaction problem
    0 references
    homomorphism problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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