Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras.
Benoît LaroseLászló ZádoriPublished in: Int. J. Algebra Comput. (2006)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- polynomial equations
- heuristic search
- arc consistency
- constraint programming
- phase transition
- soft constraints
- russian doll search
- sat solvers
- combinatorial problems
- constraint relaxation
- constraint problems
- state space
- algebraic geometry
- max csp
- learning algorithm