An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas
نویسندگان
چکیده
منابع مشابه
On the Noise Stability of Small De Morgan Formulas
We show a connection between the De Morgan formula size of a Boolean function f : {0, 1}n → {0, 1} and the noise stability of the function. Specifically, we prove that for 0 < p ≤ 1/2 it holds that NSp(f) ≥ 1− 2p √ L(f) · ‖f‖2 · (1− ‖f‖2) where NSp(f) is the noise stability of f with noise parameter p, ‖f‖ is the L2 norm of f , and L(f) is the De Morgan formula size of f . This result stems fro...
متن کاملOn an Optimal Deterministic Algorithm for SAT
J. Kraj cek and P. Pudll ak proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a p-optimal proof system for TAUT. In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p-optimal proof system for SAT. Combining Kraj cek and Pudll ak's result with our result we show that an optimal determin...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملAn Improved Local Search Algorithm for 3-SAT
We slightly improve the pruning technique presented in Dantsin et. al. (2002) to obtain an O∗ (1.473n) algorithm for 3-SAT.
متن کاملGuided Search and a Faster Deterministic Algorithm for 3-SAT
Most deterministic algorithms for NP-hard problems are splitting algorithms: They split a problem instance into several smaller ones, which they solve recursively. Often, the algorithm has a choice between several splittings. For 3-SAT, we show that choosing wisely which splitting to apply, one can avoid encountering too many worst-case instances. This improves the currently best known determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0020-z