3 search results - page 1 / 1 » A backbone-search heuristic for efficient solving of hard 3-... |
IJCAI
2001
13 years 6 months ago
2001
Of late, new insight into the study of random -SAT
AAAI
2004
13 years 6 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
ICCAD
2002
IEEE
14 years 1 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...