Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Algebra and the Complexity of Digraph CSPs: a Survey
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Unanimity Constraints Have Bounded Pathwidth Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2853188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties with few subalgebras of powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Unanimity Functions and Varieties of Reflexive Graphs / 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: \(H\)-coloring dichotomy revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualities for Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Results on the Algebraic Approach to the CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of absorption in relational structures of bounded width. / 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: Two new homomorphism dualities and lattice operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asking the Metaquestions in Constraint Tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retractions onto series-parallel posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection properties and reflexive binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of list <i>H</i>-colouring: a dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the list homomorphism problem for graphs / 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: Classification of Homomorphisms to Oriented Cycles and of <i>k</i>-Partite Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive 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: List homomorphisms of graphs with bounded degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retractions to Pseudoforests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maltsev families of varieties closed under join or Maltsev product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial graph-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of tree homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Proper Interval Digraphs and Min-Max Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semilattice polymorphisms and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Existence of Homomorphisms to Oriented Cycles / 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: Complexity and polymorphisms for digraph constraint problems under some basic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints, consistency and closure / 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: Maltsev digraphs have a majority polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP for binary conservative relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of several Maltsev conditions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new line of attack on the dichotomy conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded width problems and algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5471351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-homomorphism problems on graphs and arc consistency / 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: A polynomial-time algorithm for near-unanimity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NU Polymorphisms on Reflexive Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete homotopy theory for binary reflexive structures / 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: Algebraic properties and dismantlability of finite posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Extendibility Problem for Finite Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite posets and topological spaces in locally finite varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute retracts and varieties generated by chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflexive digraphs with near unanimity polymorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems for weakly symmetric operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone clones, residual smallness and congruence distributivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality theorems for finite structures (characterising gaps and good characterisations) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributive Lattice Polymorphism on Reflexive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflexive graphs with near unanimity but no semilattice polymorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for finite tournaments of mixed-type / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-Mal'cev condition with unexpected application. / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://dblp.uni-trier.de/db/conf/dagstuhl/dfu7.html#Larose17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2591988591 / rank
 
Normal rank
Property / title
 
Algebra and the Complexity of Digraph CSPs: a Survey (English)
Property / title: Algebra and the Complexity of Digraph CSPs: a Survey (English) / rank
 
Normal rank

Latest revision as of 10:40, 30 July 2024

scientific article; zbMATH DE number 7359815
Language Label Description Also known as
English
Algebra and the Complexity of Digraph CSPs: a Survey
scientific article; zbMATH DE number 7359815

    Statements

    0 references
    15 June 2021
    0 references
    constraint satisfaction problems
    0 references
    polymorphisms
    0 references
    digraphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Algebra and the Complexity of Digraph CSPs: a Survey (English)
    0 references

    Identifiers

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