Results 1  10
of
101,011
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.
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
The Complexity of UniqueSAT: An Isolation Lemma For kCNFs
"... We provide some evidence that Unique kSAT is as hard to solve as general kSAT, where kSAT denotes the satisfiability problem for kCNFs and Unique kSAT is the promise version where the given formula has or solutions. Namely, defining for each, atime randomized algorithm forSAT and, similarly, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We provide some evidence that Unique kSAT is as hard to solve as general kSAT, where kSAT denotes the satisfiability problem for kCNFs and Unique kSAT is the promise version where the given formula has or solutions. Namely, defining for each, atime randomized algorithm forSAT and, similarly
An Improved Exponentialtime Algorithm for kSAT
, 1998
"... We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm consists of two stages: a preprocessing stage in which resolution is applied to enlarge the set of clauses of the formula, ..."
Abstract

Cited by 116 (7 self)
 Add to MetaCart
(unique kSAT). For each k, the bounds for general kCNF are the best currently known for ...
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
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Weak lumpability in the kSAT problem
 Applied Mathematics Letters
, 1999
"... Introduction The kSAT problem, a good introduction to which is in [7], is as follows: Assume that we are given a set of n literals (Boolean variables) fs 1 ; : : : ; s n g. Choosing each time k of these, we create m clauses (conjunctions). The question is to find an assignment of these variables s ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Introduction The kSAT problem, a good introduction to which is in [7], is as follows: Assume that we are given a set of n literals (Boolean variables) fs 1 ; : : : ; s n g. Choosing each time k of these, we create m clauses (conjunctions). The question is to find an assignment of these variables
Thresholds for Random Geometric kSAT
, 2013
"... We study two geometric models of random ksatisfiability which combine random kSAT with the Random Geometric Graph: boolean literals are placed uniformly at random or according to a Poisson process in a cube, and for each set of k literals contained in a ball of a given radius, a clause is formed. ..."
Abstract
 Add to MetaCart
We study two geometric models of random ksatisfiability which combine random kSAT with the Random Geometric Graph: boolean literals are placed uniformly at random or according to a Poisson process in a cube, and for each set of k literals contained in a ball of a given radius, a clause is formed
Convex geometries in ksat problems
, 2007
"... In analyzing the survey propagation algorithm, Maneva, Mossel, and Wainwright discovered a polynomial identity that holds for a Boolean formula F and a satisfying assignment a. We show that F and a give rise to a convex geometry, and that convex geometries are precisely the combinatorial objects sat ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In analyzing the survey propagation algorithm, Maneva, Mossel, and Wainwright discovered a polynomial identity that holds for a Boolean formula F and a satisfying assignment a. We show that F and a give rise to a convex geometry, and that convex geometries are precisely the combinatorial objects satisfying (the multivariate analog of) that polynomial identity. 1
Thresholds in Random Graphs and ksat
, 2006
"... In their seminal work [6],[7], Erdos and Renyi invented the notion of random graphs and made the fundamental observation that when the parameter controlling the edge probability varies, the random system undergoes a dramatic and swift qualitative change. “Much like water that freezes abruptly as it ..."
Abstract
 Add to MetaCart
In their seminal work [6],[7], Erdos and Renyi invented the notion of random graphs and made the fundamental observation that when the parameter controlling the edge probability varies, the random system undergoes a dramatic and swift qualitative change. “Much like water that freezes abruptly as its
Results 1  10
of
101,011