scientific article; zbMATH DE number 7053313
From MaRDI portal
Publication:5743434
zbMath1423.68215MaRDI QIDQ5743434
Stanislav Živný, Vladimir Kolmogorov
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095177
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring, constraint satisfaction, and complexity
- Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
- A dichotomy theorem for maximum generalized satisfiability problems.
- Network-based heuristics for constraint-satisfaction problems
- An optimal k-consistency algorithm
- Optimization, approximation, and complexity classes
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- Constraints, consistency and closure
- On the algebraic structure of combinatorial problems
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Conjunctive-query containment and constraint satisfaction
- Perspectives of Monge properties in optimization
- The complexity of soft constraint satisfaction
- The Approximability of Constraint Satisfaction Problems
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries
- A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
- Min CSP on Four Elements: Moving beyond Submodularity
- CSP dichotomy for special triads
- The approximability of MAX CSP with fixed-value constraints
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Varieties with few subalgebras of powers
- Extensions of the Minimum Cost Homomorphism Problem
- Graphical Models, Exponential Families, and Variational Inference
- Constraint solving via fractional edge covers
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Closure properties of constraints
- Semiring-based constraint satisfaction and optimization
- Constraint Satisfaction Problems of Bounded Width
- How to Round Any CSP
- A new line of attack on the dichotomy conjecture
- Classifying the Complexity of Constraints Using Finite Algebras
- The complexity of satisfiability problems
This page was built for publication:
