Results 171 to 180 of about 44,520 (208)
Some of the next articles are maybe not open access.
Proceedings 38th Annual Symposium on Foundations of Computer Science, 2002
Summary: In this paper, we prove a lemma that shows how to encode satisfying solutions of a \(k\)-CNF (boolean formulae in conjunctive normal form with at most \(k\) literals per clause) succinctly. Using this lemma, which we call the satisfiability coding lemma, we prove tight lower bounds on depth-3 circuits and improved upper bounds for the \(k ...
Ramamohan Paturi +2 more
openaire +3 more sources
Summary: In this paper, we prove a lemma that shows how to encode satisfying solutions of a \(k\)-CNF (boolean formulae in conjunctive normal form with at most \(k\) literals per clause) succinctly. Using this lemma, which we call the satisfiability coding lemma, we prove tight lower bounds on depth-3 circuits and improved upper bounds for the \(k ...
Ramamohan Paturi +2 more
openaire +3 more sources
Equation Satisfiability and Program Satisfiability for Finite Monoids
2000We study the computational complexity of solving equations and of determining the satisfiability of programs over a fixed finite monoid. We partially answer an open problem of [4] by exhibiting quasi-polynomial time algorithms for a subclass of solvable nonnilpotent groups and relate this question to a natural circuit complexity conjecture.
David A. Mix Barrington +4 more
openaire +1 more source
From Propositional Satisfiability to Satisfiability Modulo Theories
2006In this paper we present a review of SAT-based approaches for building scalable and efficient decision procedures for quantifier-free first-order logic formulas in one or more decidable theories, known as Satisfiability Modulo Theories (SMT) problems.
Hossein M. Sheini, Karem A. Sakallah
openaire +1 more source
Efficient Temporal Satisfiability
Journal of Logic and Computation, 1992The complexity of testing satisfiability of almost all extant propositional logics of programs is \(NP\)-hard, because these logics subsume ordinary propositional logic. If the conjecture \(P\neq NP\) is true, it seems likely that the best deterministic decision procedure we could hope for is of exponential time complexity. This interesting paper gives
E. Allen Emerson +2 more
openaire +2 more sources
The Inverse Satisfiability Problem
SIAM Journal on Computing, 1996Summary: We study the complexity of telling whether a set of bit-vectors represents the set of all satisfying truth assignments of a Boolean expression of a certain type. We show that the problem is coNP-complete when the expression is required to be in conjunctive normal form with three literals per clause (3CNF).
Dimitris J. Kavvadias, Martha Sideri
openaire +1 more source
On the Approximation of Maximum Satisfiability
Journal of Algorithms, 1994Summary: We present a 3/4 polynomial time approximation algorithm for the maximum satisfiability problem: Given a set of clauses, find a truth assignment that satisfies the maximum number of clauses. The algorithm applies to the weighted case as well, and involves nontrivial application of network flow techniques.
openaire +3 more sources
Weighted Random k Satisfiability for k = 1 , 2 (r2SAT) in Discrete Hopfield Neural Network
Applied Soft Computing Journal, 2022Nur Ezlín Zamri +2 more
exaly
Novel Hopfield Neural Network Model with Election Algorithm for Random 3 Satisfiability
Processes, 2021Siti Zulaikha Mohd Jamaludin +2 more
exaly