TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
From MaRDI portal
Publication:5483456
Recommendations
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
- Classifying the Complexity of Constraints Using Finite Algebras
- Complexity classifications of Boolean constraint satisfaction problems
- Congruence join semidistributivity is equivalent to a congruence identity.
- Conjunctive-query containment and constraint satisfaction
- Constraints, consistency and closure
- Dichotomies for classes of homomorphism problems involving unary functions
- Laws obeyed by topological algebras - extending results of Hopf and Adams
- On the algebraic structure of combinatorial problems
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- Semigroups obeying the term condition
- The Complexity of the Extendibility Problem for Finite Posets
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The complexity of solving equations over finite groups
- The number of non-isomorphic models in quasi-varieties of semigroups
- Unary polynomials in algebras. I
- Varieties Obeying Homotopy Laws
Cited in
(28)- An assertion concerning functionally complete algebras and NP-completeness
- The complexity of the equivalence problem over finite rings.
- Expressive power, satisfiability and equivalence of circuits over nilpotent algebras
- SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
- Tractability in constraint satisfaction problems: a survey
- Computational complexity of solving equation systems
- Computing and Combinatorics
- Dichotomy for finite tournaments of mixed-type
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- scientific article; zbMATH DE number 7561716 (Why is no real title available?)
- Loosely-abelian algebras
- Quantified Constraints in Twenty Seventeen
- Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
- Efficient verification of polynomial completeness of quasigroups
- Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
- Solving equations over small unary algebras
- Satisfiability in multi-valued circuits
- Satisfiability in MultiValued Circuits
- scientific article; zbMATH DE number 4114007 (Why is no real title available?)
- Term equation satisfiability over finite algebras
- On complexity of solving of equations over graphs
- Hard constraint satisfaction problems have hard gaps at location 1
- On solvability of systems of polynomial equations
- On complexity of the satisfiability problem of systems over finite posets
- Polynomial constraints and unsat cores in \textsc{Tarski}
- Robustly solvable constraint satisfaction problems
- THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
This page was built for publication: TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483456)
