Lower bound for the Complexity of the Boolean Satisfiability Problem [PDF]
CoRR, 2016 arXiv admin note: text overlap with arXiv:1510 ...
Carlos Barrón-Romero
openalex +3 more sources
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT [PDF]
Entropy, 2022 The (weighted) partial maximum satisfiability ((W)PMS) problem is an important generalization of the classic problem of propositional (Boolean) satisfiability with a wide range of real-world applications. In this paper, we propose an initialization and a
Zaijun Zhang +4 more
doaj +2 more sources
The number system hidden inside the Boolean satisfiability problem [PDF]
CoRR, 2014 This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler. Through the analysis of the SAT problem using the elements, I prove that we can construct a k-SAT (k>2) instance where the coefficients of cutting planes take ...
Keum-Bae Cho
openalex +3 more sources
The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis [PDF]
Journal of Computer and System Sciences, 2017 We aim at investigating the solvability/insolvability of nondeterministic logarithmic-space (NL) decision, search, and optimization problems parameterized by natural size parameters using simultaneously polynomial time and sub-linear space. We are particularly focused on $\mathrm{2SAT}_3$ -- a restricted variant of the 2CNF Boolean (propositional ...
Tomoyuki Yamakami
openalex +6 more sources
Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems with Applications to Probabilistic State Reachability and Region Stability [PDF]
Logical Methods in Computer Science, 2012 The stochastic Boolean satisfiability (SSAT) problem has been introduced by Papadimitriou in 1985 when adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification.
Tino Teige, Martin Fränzle
doaj +2 more sources
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. [PDF]
Springerplus, 2016 Semenov A, Zaikin O.
europepmc +3 more sources
Engineering the development of quantum programs: Application to the Boolean satisfiability problem
Advances in Engineering Software, 2022 The development of quantum programs is becoming a reality due to the rapid advancement of quantum computing. Over the past few years, a multitude of hardware platforms, algorithms, and programming languages have emerged to support this paradigm. By the very nature of Quantum Mechanics principles, there is an enormous change of philosophy when building ...
Diego Alonso +2 more
openalex +3 more sources
Multi-step partitioning combined with SOM neural network-based clustering technique effectively improves SAT solver performance [PDF]
PeerJ Computer ScienceAs the core engine of electronic design automation (EDA) tools, the efficiency of Boolean Satisfiability Problem (SAT) solver largely determines the cycle of integrated circuit research and development.
Siyu Yun, Xinsheng Wang
doaj +3 more sources
Order-to-chaos transition in the hardness of random Boolean satisfiability problems [PDF]
Physical Review E, 2016 Transient chaos is an ubiquitous phenomenon characterizing the dynamics of phase space trajectories evolving towards a steady state attractor in physical systems as diverse as fluids, chemical reactions and condensed matter systems. Here we show that transient chaos also appears in the dynamics of certain efficient algorithms searching for solutions of
Róbert Sumi +3 more
openalex +5 more sources
Accelerating hybrid XOR-CNF Boolean satisfiability problems natively with in-memory computing. [PDF]
Nat CommunIm H +16 more
europepmc +2 more sources