11 search results - page 1 / 3 » Typical random 3-SAT formulae and the satisfiability thresho... |
SODA
2000
ACM
13 years 7 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
ICS
2010
Tsinghua U.
13 years 10 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...
FCS
2006
13 years 7 months ago
2006
-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...
CORR
1999
Springer
13 years 5 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
ICAI
2003
13 years 7 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...