70 search results - page 10 / 14 » Universal Algebra and Hardness Results for Constraint Satisf... |
135
click to vote
COCO
2008
Springer
15 years 3 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
132
Voted
IJCAI
2003
15 years 3 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
126
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
125
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
116
Voted
AI
2000
Springer
15 years 1 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...