5138 search results - page 5 / 1028 » Randomized Algorithms for 3-SAT |
ICS
2010
Tsinghua U.
13 years 11 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
ICAI
2003
13 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
TCS
2002
13 years 7 months ago
2002
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
JAIR
2000
13 years 7 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
FOCI
2007
IEEE
14 years 1 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...