Results 91 to 100 of about 770 (181)
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
PRX QuantumOne of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses of the complexity of standard quantum algorithms have suggested that outperforming classical ...
Sami Boulebnane, Ashley Montanaro
doaj +1 more source
Satisfiability in intuitionistic fuzzy logic with realistic tautology
Kuwait Journal of Science, 2018 Any variable in Intuitionistic Fuzzy Logic (IFL) is either a Realistic Fuzzy Tautology (RFT) with a Truth exceeding one half, or a non-Realistic Fuzzy Tautology (nRFT) with a Truth less than or equal to one half.
Ali Muhammad Rushdi +3 more
doaj
Труды Института системного программирования РАН, 2018 This paper focuses on dynamic program analysis optimization through the use of distributed computing scheme and parallel computing for checking satisfiability of Boolean constraint sets.
M. K. Ermakov, A. Y. Gerasimov
doaj
Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation. [PDF]
PLoS One, 2023 Ali GA +5 more
europepmc +1 more source
A Computational Trichotomy for Connectivity of Boolean Satisfiability
Journal on Satisfiability, Boolean Modeling and Computation, 2014 For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. Motivated by research on heuristics and the satisfiability threshold, in 2006, Gopalan et al.
openaire +3 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 +1 more source
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
New Journal of PhysicsBoolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong +2 more
doaj +1 more source
Synthesising Programs with Non-trivial Constants. [PDF]
J Autom Reason, 2023 Abate A +8 more
europepmc +1 more source
Logical computation with self-assembling electric circuits. [PDF]
PLoS One, 2022 Yasmin R, Deaton R.
europepmc +1 more source