scientific article; zbMATH DE number 7359807
From MaRDI portal
Publication:4993595
DOI10.4230/DFU.Vol7.15301.45zbMath1482.68160MaRDI QIDQ4993595
Publication date: 15 June 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Computational aspects of satisfiability (68R07)
Related Items (13)
On a stronger reconstruction notion for monoids and clones ⋮ Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) ⋮ THE DISTRIBUTIVITY SPECTRUM OF BAKER’S VARIETY ⋮ On the complexity of \(\mathbb{H}\)-coloring for special oriented trees ⋮ Unnamed Item ⋮ Loop conditions ⋮ Smooth digraphs modulo primitive positive constructability and cyclic loop conditions ⋮ Loop conditions for strongly connected digraphs ⋮ Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) ⋮ Mitschke's theorem is sharp ⋮ The number of clones determined by disjunctions of unary relations ⋮ Between an n-ary and an n + 1-ary near-unanimity term ⋮ The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mal'tsev conditions, lack of absorption, and solvability.
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited
- \(H\)-coloring dichotomy revisited
- Conservative constraint satisfaction re-revisited
- Bounded width problems and algebras
- Existence theorems for weakly symmetric operations
- On the complexity of H-coloring
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- On the algebraic structure of combinatorial problems
- Finitely related algebras in congruence modular varieties have few subpowers
- The wonderland of reflections
- Generic expression hardness results for primitive positive formula comparison
- Characterizations of several Maltsev conditions.
- Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
- Closed systems of functions and predicates
- THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
- The collapse of the bounded width hierarchy
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
- Complexity of conservative constraint satisfaction problems
- Near Unanimity Constraints Have Bounded Pathwidth Duality
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- A Subalgebra Intersection Property for Congruence Distributive Varieties
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The structure of finite algebras
- Varieties Obeying Homotopy Laws
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Closure properties of constraints
- Robust algorithms with polynomial loss for near-unanimity CSPs
- Absorption and directed Jónsson terms
- The weakest nontrivial idempotent equations
- The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
- Weak consistency notions for all the CSPs of bounded width
- Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms
- Classifying the Complexity of Constraints Using Finite Algebras
- Robust satisfiability of constraint satisfaction problems
- A Simple Algorithm for Mal'tsev Constraints
- Constraint Satisfaction Problems with Infinite Templates
- Algebras Whose Congruence Lattices are Distributive.
This page was built for publication:
