On the algebraic structure of combinatorial problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3972929 (Why is no real title available?)
- scientific article; zbMATH DE number 3972930 (Why is no real title available?)
- scientific article; zbMATH DE number 3987347 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- Characterising tractable constraints
- Closed systems of functions and predicates
- Fast parallel constraint satisfaction
- Networks of constraints: Fundamental properties and applications to picture processing
- On binary constraint problems
- On the complexity of colouring by superdigraphs of bipartite graphs
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- The complexity of satisfiability problems
Cited in
(only showing first 100 items - show all)- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
- Learnability of solutions to conjunctive queries
- Absorption in universal algebra and CSP
- Algebra and the complexity of digraph CSPs: a survey
- Supermodular functions and the complexity of MAX CSP
- On the Computational Complexity of Monotone Constraint Satisfaction Problems
- On solvability of systems of polynomial equations
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
- The Expressive Power of Valued Constraints: Hierarchies and Collapses
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
- A practical algorithm for structure embedding
- Commutative idempotent groupoids and the constraint satisfaction problem.
- On the algebraic combinatorics of injections
- Periodic constraint satisfaction problems: Tractable subclasses
- Constraint satisfaction problem: what makes the problem easy
- An algebraic formulation of Thurston’s combinatorial equivalence
- Minimization of locally defined submodular functions by optimal soft arc consistency
- Rigid binary relations on a 4-element domain
- Gap theorems for robust satisfiability: Boolean CSPs and beyond
- In praise of homomorphisms
- Partial Polymorphisms and Constraint Satisfaction Problems
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
- The number of clones determined by disjunctions of unary relations
- An algebraic characterization of testable Boolean CSPs
- Tractability conditions for numeric CSPs
- scientific article; zbMATH DE number 7559384 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- The expressive power of valued constraints: Hierarchies and collapses
- The complexity of surjective homomorphism problems-a survey
- List homomorphism problems for signed trees
- Generalisations of matrix partitions: complexity and obstructions
- Conditional dichotomy of Boolean ordered promise CSPs
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
- Quantified constraint satisfaction and the polynomially generated powers property
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- Tractability in constraint satisfaction problems: a survey
- Weak bases of Boolean co-clones
- Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy
- Recent Results on the Algebraic Approach to the CSP
- scientific article; zbMATH DE number 7536562 (Why is no real title available?)
- Algebraic Combinatorics
- Colouring, constraint satisfaction, and complexity
- scientific article; zbMATH DE number 7559391 (Why is no real title available?)
- Recognizing frozen variables in constraint satisfaction problems
- The expressive rate of constraints
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
- The power of linear programming for general-valued CSPs
- Time complexity of constraint satisfaction via universal algebra
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
- Dualities for Constraint Satisfaction Problems
- Hybrid tractability of valued constraint problems
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- The complexity of counting homomorphisms seen from the other side
- A note on some collapse results of valued constraints
- The complexity of conservative valued CSPs
- Combinatorial Structures on van der Waerden sets
- Conservative constraint satisfaction re-revisited
- scientific article; zbMATH DE number 5139236 (Why is no real title available?)
- Constants and finite unary relations in qualitative constraint reasoning
- Relatively quantified constraint satisfaction
- scientific article; zbMATH DE number 1880257 (Why is no real title available?)
- Problems in algebraic combinatorics
- Complexity Classifications for Logic-Based Argumentation
- A polynomial relational class of binary CSP
- Quantified Constraints in Twenty Seventeen
- On uniform relationships between combinatorial problems
- On linear combinatorics. I: Concurrency---an algebraic approach
- List homomorphisms to separable signed graphs
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
- Algebras for combinatorial search
- Conjunctive-query containment and constraint satisfaction
- On Boolean primitive positive clones
- Nonnegative weighted \#CSP: an effective complexity dichotomy
- scientific article; zbMATH DE number 1539537 (Why is no real title available?)
- Computing a partition function of a generalized pattern-based energy over a semiring
- Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
- scientific article; zbMATH DE number 7536113 (Why is no real title available?)
- CLAP: A New Algorithm for Promise CSPs
- The \(C_{k}\)-extended graft construction
- A new tractable class of constraint satisfaction problems
- Majority constraints have bounded pathwidth duality
- \(H\)-coloring degree-bounded (acyclic) digraphs
- The complexity of general-valued CSPs
- On the general coloring problem
- Maltsev digraphs have a majority polymorphism
- Galois connections for patterns: an algebra of labelled graphs
- Necessary conditions for tractability of valued CSPs
- Complexity classification transfer for CSPs via algebraic products
- H-coloring dichotomy revisited
- On the intricacy of combinatorial construction problems
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- The complexity of constraint satisfaction games and QCSP
- A new line of attack on the dichotomy conjecture
- Algorithmic combinatorics based on slicing posets
- A combinatorial constraint satisfaction problem dichotomy classification conjecture
- Domain permutation reduction for constraint satisfaction problems
This page was built for publication: On the algebraic structure of combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276253)
