251,501 research outputs found
Biased random satisfiability problems: From easy to hard instances
In this paper we study biased random K-SAT problems in which each logical
variable is negated with probability . This generalization provides us a
crossover from easy to hard problems and would help us in a better
understanding of the typical complexity of random K-SAT problems. The exact
solution of 1-SAT case is given. The critical point of K-SAT problems and
results of replica method are derived in the replica symmetry framework. It is
found that in this approximation for .
Solving numerically the survey propagation equations for K=3 we find that for
there is no replica symmetry breaking and still the SAT-UNSAT
transition is discontinuous.Comment: 17 pages, 8 figure
A new construction for a QMA complete 3-local Hamiltonian
We present a new way of encoding a quantum computation into a 3-local
Hamiltonian. Our construction is novel in that it does not include any terms
that induce legal-illegal clock transitions. Therefore, the weights of the
terms in the Hamiltonian do not scale with the size of the problem as in
previous constructions. This improves the construction by Kempe and Regev, who
were the first to prove that 3-local Hamiltonian is complete for the complexity
class QMA, the quantum analogue of NP.
Quantum k-SAT, a restricted version of the local Hamiltonian problem using
only projector terms, was introduced by Bravyi as an analogue of the classical
k-SAT problem. Bravyi proved that quantum 4-SAT is complete for the class QMA
with one-sided error (QMA_1) and that quantum 2-SAT is in P. We give an
encoding of a quantum circuit into a quantum 4-SAT Hamiltonian using only
3-local terms. As an intermediate step to this 3-local construction, we show
that quantum 3-SAT for particles with dimensions 3x2x2 (a qutrit and two
qubits) is QMA_1 complete. The complexity of quantum 3-SAT with qubits remains
an open question.Comment: 11 pages, 4 figure
Almost 2-SAT is Fixed-Parameter Tractable
We consider the following problem. Given a 2-CNF formula, is it possible to
remove at most clauses so that the resulting 2-CNF formula is satisfiable?
This problem is known to different research communities in Theoretical Computer
Science under the names 'Almost 2-SAT', 'All-but- 2-SAT', '2-CNF deletion',
'2-SAT deletion'. The status of fixed-parameter tractability of this problem is
a long-standing open question in the area of Parameterized Complexity. We
resolve this open question by proposing an algorithm which solves this problem
in and thus we show that this problem is fixed-parameter
tractable.Comment: This new version fixes the bug found by Somnath Sikdar in the proof
of Claim 8. In the repaired version the modification of the Almost 2-SAT
problem called 2-SLASAT is no longer needed and only the modification called
2-ASLASAT remains relevant. Hence the whole manuscript is updated so that the
2-SLASAT problem is not mentioned there anymor
On the Equivalence among Problems of Bounded Width
In this paper, we introduce a methodology, called decomposition-based
reductions, for showing the equivalence among various problems of
bounded-width.
First, we show that the following are equivalent for any :
* SAT can be solved in time,
* 3-SAT can be solved in time,
* Max 2-SAT can be solved in time,
* Independent Set can be solved in time, and
* Independent Set can be solved in time, where
tw and cw are the tree-width and clique-width of the instance, respectively.
Then, we introduce a new parameterized complexity class EPNL, which includes
Set Cover and Directed Hamiltonicity, and show that SAT, 3-SAT, Max 2-SAT, and
Independent Set parameterized by path-width are EPNL-complete. This implies
that if one of these EPNL-complete problems can be solved in time,
then any problem in EPNL can be solved in time.Comment: accepted to ESA 201
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT
The parameterized satisfiability problem over a set of Boolean
relations Gamma (SAT(Gamma)) is the problem of determining
whether a conjunctive formula over Gamma has at least one
model. Due to Schaefer\u27s dichotomy theorem the computational
complexity of SAT(Gamma), modulo polynomial-time reductions, has
been completely determined: SAT(Gamma) is always either tractable
or NP-complete. More recently, the problem of studying the
relationship between the complexity of the NP-complete cases of
SAT(Gamma) with restricted notions of reductions has attracted
attention. For example, Impagliazzo et al. studied the complexity of
k-SAT and proved that the worst-case time complexity increases
infinitely often for larger values of k, unless 3-SAT is solvable in
subexponential time. In a similar line of research Jonsson et al.
studied the complexity of SAT(Gamma) with algebraic tools borrowed
from clone theory and proved that there exists an NP-complete problem
SAT(R^{neq,neq,neq,01}_{1/3}) such that there cannot exist any NP-complete SAT(Gamma) problem with strictly lower worst-case time complexity: the easiest NP-complete SAT(Gamma) problem. In this paper
we are interested in classifying the NP-complete SAT(Gamma)
problems whose worst-case time complexity is lower than 1-in-3-SAT but
higher than the easiest problem SAT(R^{neq,neq,neq,01}_{1/3}). Recently it was conjectured that there only exists three satisfiability problems of this form. We prove that this conjecture does not hold and that there is an infinite number of such SAT(Gamma) problems. In the process we determine several algebraic properties of 1-in-3-SAT and related problems, which could be of independent interest for constructing exponential-time algorithms
- …