Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
2 of
2
3-SAT Faster and Simpler — UniqueSAT Bounds for PPSZ Hold in General
, 2011
"... The PPSZ algorithm by Paturi, Pudlák, Saks, and Zane [7] is the fastest known algorithm for Unique k-SAT, where the input formula does not have more than one satisfying assignment. For k ≥ 5 the same bounds hold for general k-SAT. We show that this is also the case for k = 3,4, using a slightly modi ..."
Abstract
-
Cited by 17 (0 self)
- Add to MetaCart
The PPSZ algorithm by Paturi, Pudlák, Saks, and Zane [7] is the fastest known algorithm for Unique k-SAT, where the input formula does not have more than one satisfying assignment. For k ≥ 5 the same bounds hold for general k-SAT. We show that this is also the case for k = 3,4, using a slightly
von
, 2011
"... Diese Dissertation wurde vom Cuvillier Verlag Göttingen als Buch unter ISBN 978-3-95404-019-3 veröffentlicht (www.cuvillier.de). iContents ..."
Abstract
- Add to MetaCart
Diese Dissertation wurde vom Cuvillier Verlag Göttingen als Buch unter ISBN 978-3-95404-019-3 veröffentlicht (www.cuvillier.de). iContents
