Results 51 to 60 of about 12,229,216 (240)
New Journal of Physics, 2016 We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists ...
Salvatore Mandrà +2 more
doaj +1 more source
Bose–Einstein condensation in satisfiability problems [PDF]
European Journal of Operational Research, 2013 This paper is concerned with the complex behavior arising in satisfiability problems. We present a new statistical physics-based characterization of the satisfiability problem. Specifically, we design an algorithm that is able to produce graphs starting from a k-SAT instance, in order to analyze them and show whether a Bose-Einstein condensation occurs.
C. Angione +3 more
openaire +4 more sources
Algorithmic Problems for Computation Trees
LogicsIn this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems.
Mikhail Moshkov
doaj +1 more source
Predicting Propositional Satisfiability Based on Graph Attention Networks
International Journal of Computational Intelligence Systems, 2022 Boolean satisfiability problems (SAT) have very rich generic and domain-specific structures. How to capture these structural features in the embedding space and feed them to deep learning models is an important factor influencing the use of neural ...
Wenjing Chang, Hengkai Zhang, Junwei Luo
doaj +1 more source
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
, 2006 We show that the finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of a result recently obtained by Y.
Pratt-Hartmann, Ian
core +1 more source
Solving the 3‐Satisfiability Problem Using Network‐Based Biocomputation
Advanced Intelligent Systems, 2022 The 3‐satisfiability Problem (3‐SAT) is a demanding combinatorial problem that is of central importance among the nondeterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence, and logistics.
Jingyuan Zhu +10 more
doaj +1 more source
Advanced Physics Research, EarlyView.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source
R ( 5 , 5 ) ≤ 46 $R(5,5)\le 46$
Journal of Graph Theory, EarlyView.ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) $R(5,5)$ is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley +1 more source
A Constructive Quantum Lov\'asz Local Lemma for Commuting Projectors [PDF]
, 2013 The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors.
Arad, Itai, Sattath, Or
core