614 search results - page 10 / 123 » Computational Complexity of Multi-way, Dataflow Constraint P... |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
14 years 1 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
FOCS
1999
IEEE
14 years 2 days ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...