Limitations of affine integer relaxations for solving constraint satisfaction problems
From MaRDI portal
Cites work
- A dichotomy theorem for nonuniform CSPs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A proof of the CSP dichotomy conjecture
- A Simple Algorithm for Mal'tsev Constraints
- Algebraic Approach to Promise Constraint Satisfaction
- An algorithmic blend of LPs and ring equations for promise CSPs
- An optimal lower bound on the number of variables for graph identification
- Approximate Graph Colouring and Crystals
- Approximate graph colouring and the hollow shadow
- CLAP: A New Algorithm for Promise CSPs
- Cohomology in constraint satisfaction and structure isomorphism
- Constraint Satisfaction Problems of Bounded Width
- Hierarchies of Minion Tests for PCSPs through Tensors
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Limitations of algebraic approaches to graph isomorphism testing
- Linear Diophantine Equations, Group CSPs, and Graph Isomorphism
- Local consistency as a reduction between constraint satisfaction problems
- Monotone monadic SNP and constraint satisfaction
- On the Power of k-Consistency
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Rank logic is dead, long live rank logic!
- The collapse of the bounded width hierarchy
- The complexity of finite-valued CSPs
- The complexity of solving equations over finite groups
This page was built for publication: Limitations of affine integer relaxations for solving constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397627)
