On the algebraic structure of combinatorial problems
From MaRDI portal
Recommendations
Cites work
- Characterising tractable constraints
- Closed systems of functions and predicates
- Fast parallel constraint satisfaction
- 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?)
- 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)- Existentially restricted quantified constraint satisfaction
- Universal algebra and hardness results for constraint satisfaction problems
- Minimization of locally defined submodular functions by optimal soft arc consistency
- Relatively quantified constraint satisfaction
- A combinatorial constraint satisfaction problem dichotomy classification conjecture
- On linear combinatorics. I: Concurrency---an algebraic approach
- Problems in algebraic combinatorics
- Conjunctive-query containment and constraint satisfaction
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic
- Constants and finite unary relations in qualitative constraint reasoning
- A new tractable class of constraint satisfaction problems
- Galois connections for patterns: an algebra of labelled graphs
- List homomorphism problems for signed trees
- On the algebraic combinatorics of injections
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
- The \(C_{k}\)-extended graft construction
- A practical algorithm for structure embedding
- The number of clones determined by disjunctions of unary relations
- Commutative idempotent groupoids and the constraint satisfaction problem.
- Supermodular functions and the complexity of MAX CSP
- Domain permutation reduction for constraint satisfaction problems
- Majority constraints have bounded pathwidth duality
- Weak bases of Boolean co-clones
- The complexity of soft constraint satisfaction
- Combinatorial problems raised from 2-semilattices
- Algorithmic combinatorics based on slicing posets
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- Tractability in constraint satisfaction problems: a survey
- The constraint satisfaction problem and universal algebra
- On uniform relationships between combinatorial problems
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
- Complexity Classifications for Logic-Based Argumentation
- On the general coloring problem
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
- Term equation satisfiability over finite algebras
- Nonnegative weighted \#CSP: an effective complexity dichotomy
- Approximability of the Maximum Solution Problem for Certain Families of Algebras
- Strong partial clones and the time complexity of SAT problems
- scientific article; zbMATH DE number 5139236 (Why is no real title available?)
- Necessary conditions for tractability of valued CSPs
- The Expressive Power of Valued Constraints: Hierarchies and Collapses
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
- Varieties with few subalgebras of powers
- On the Computational Complexity of Monotone Constraint Satisfaction Problems
- Algebras for combinatorial search
- An algebraic formulation of Thurston’s combinatorial equivalence
- The complexity of surjective homomorphism problems-a survey
- scientific article; zbMATH DE number 1539537 (Why is no real title available?)
- scientific article; zbMATH DE number 6970794 (Why is no real title available?)
- Colouring, constraint satisfaction, and complexity
- scientific article; zbMATH DE number 1880257 (Why is no real title available?)
- An Algebraic Model for Combinatorial Problems
- Algebraic Combinatorics
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Absorption in universal algebra and CSP
- Algebra and the complexity of digraph CSPs: a survey
- Quantified Constraints in Twenty Seventeen
- scientific article; zbMATH DE number 7559384 (Why is no real title available?)
- scientific article; zbMATH DE number 7559391 (Why is no real title available?)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- On the strength of uniqueness quantification in primitive positive formulas
- Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy
- Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
- Time complexity of constraint satisfaction via universal algebra
- Hybrid VCSPs with crisp and valued conservative templates
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
- Rigid binary relations on a 4-element domain
- The power of linear programming for general-valued CSPs
- Gap theorems for robust satisfiability: Boolean CSPs and beyond
- The complexity of general-valued CSPs
- An algebraic characterization of testable Boolean CSPs
- Combinatorial Structures on van der Waerden sets
- Learnability of solutions to conjunctive queries
- Bounded Tree-Width and CSP-Related Problems
- Quantified constraint satisfaction and the polynomially generated powers property
- On solvability of systems of polynomial equations
- TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
- Basics of Galois Connections
- Recent Results on the Algebraic Approach to the CSP
- Dualities for Constraint Satisfaction Problems
- Partial Polymorphisms and Constraint Satisfaction Problems
- Theory and Applications of Satisfiability Testing
- The complexity of conservative valued CSPs
- Strong subalgebras and the constraint satisfaction problem
- A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
- CLAP: A New Algorithm for Promise CSPs
- List homomorphisms to separable signed graphs
- Constraint satisfaction problem: what makes the problem easy
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- Computing a partition function of a generalized pattern-based energy over a semiring
- Quantaloidal approach to constraint satisfaction
- Maltsev digraphs have a majority polymorphism
- Hybrid tractability of valued constraint problems
- SDPs and robust satisfiability of promise CSP
- Generalisations of matrix partitions: complexity and obstructions
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
- Conditional dichotomy of Boolean ordered promise CSPs
- Complexity classification transfer for CSPs via algebraic products
- Exploring new topologies for the theory of clones
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)
