Results 1  10
of
758
Derandomization of ppsz for uniqueksat
 In Bacchus and Walsh [BW05
"... Abstract. The PPSZ algorithm presented by Paturi, Pudlak, Saks, and Zane in 1998 has the nice feature that the only satisfying solution of a uniquely satisable 3SAT formulas can be found in expected running time at most O(1:3071n): Using the technique of limited independence, we can derandomize thi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. The PPSZ algorithm presented by Paturi, Pudlak, Saks, and Zane in 1998 has the nice feature that the only satisfying solution of a uniquely satisable 3SAT formulas can be found in expected running time at most O(1:3071n): Using the technique of limited independence, we can derandomize
An Approximation Algorithm for #kSAT
"... We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #kSAT for any k ≥ 3 within a running time that is not only nontrivial, but als ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #kSAT for any k ≥ 3 within a running time that is not only non
Unique kSAT is as Hard as kSAT
, 2006
"... In this work we show that Unique kSAT is as hard as kSAT for every k ∈ N. This settles a conjecture by Calabro, Impagliazzo, Kabanets and Paturi [CIKP03]. To provide an affirmative answer to this conjecture, we develop a randomness optimal construction of Isolation Lemma for kSAT. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this work we show that Unique kSAT is as hard as kSAT for every k ∈ N. This settles a conjecture by Calabro, Impagliazzo, Kabanets and Paturi [CIKP03]. To provide an affirmative answer to this conjecture, we develop a randomness optimal construction of Isolation Lemma for kSAT.
3SAT 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 kSAT, where the input formula does not have more than one satisfying assignment. For k ≥ 5 the same bounds hold for general kSAT. 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 kSAT, where the input formula does not have more than one satisfying assignment. For k ≥ 5 the same bounds hold for general kSAT. We show that this is also the case for k = 3,4, using a slightly
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus on parameterized complexity, and it hopefully serves as a driving force in the development of the eld. 1 We had 49 participants from Australia, Canada, India, Israel, New Zealand, USA, and various European countries. During the workshop 25 lectures were given. Moreover, one night session was devoted to open problems and Thursday was basically used for problem discussion
Improved Bound for the PPSZ/SchöningAlgorithm for 3SAT
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 159
, 2005
"... Zane in 1998 has the nice feature that the only satisfying solution of a uniquely satisfiable 3SAT formula can be found in expected running time at most O(1.3071 n). Its bound degenerates when the number of solutions increases. In 1999, Schöning proved an bound of O(1.3334 n) for 3SAT. In 2003, Iw ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Zane in 1998 has the nice feature that the only satisfying solution of a uniquely satisfiable 3SAT formula can be found in expected running time at most O(1.3071 n). Its bound degenerates when the number of solutions increases. In 1999, Schöning proved an bound of O(1.3334 n) for 3SAT. In 2003
Derandomization in cryptography
 SIAM J. Computing
"... Abstract. We give two applications of Nisan–Wigdersontype (“noncryptographic”) pseudorandom generators in cryptography. Specifically, assuming the existence of an appropriate NWtype generator, we construct: 1. A onemessage witnessindistinguishable proof system for every language in NP, based on ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
nondeterministic circuits. It is known how to construct such a generator if E = DTIME(2 O(n) ) has a function of nondeterministic circuit complexity 2 Ω(n) (Miltersen and Vinodchandran, FOCS ‘99). Our witnessindistinguishable proofs are obtained by using the NWtype generator to derandomize the ZAPs of Dwork
Deterministic algorithms for kSAT based on covering codes and local search
 Proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP'2000, volume 1853 of Lecture Notes in Computer Science
, 2000
"... Abstract. We show that satisfiability of formulas in kCNF can be decided deterministically in time close to (2k/(k + 1)) n, where n is the number of variables in the input formula. This is the best known worstcase upper bound for deterministic kSAT algorithms. Our algorithm can be viewed as a dera ..."
Abstract

Cited by 21 (10 self)
 Add to MetaCart
Abstract. We show that satisfiability of formulas in kCNF can be decided deterministically in time close to (2k/(k + 1)) n, where n is the number of variables in the input formula. This is the best known worstcase upper bound for deterministic kSAT algorithms. Our algorithm can be viewed as a
Results 1  10
of
758