Search Results - (("boolean satisfiability problem") OR ("boolean satisfiability problemys"))

Machine Learning Methods in Solving the Boolean Satisfiability Problem by Guo, Wenxuan, Zhen, Hui-Ling, Li, Xijun, Luo, Wanqian, Yuan, Mingxuan, Jin, Yaohui, Yan, Junchi

“…This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT…”
Get full text

Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem by Zhang, Zhidong

“…The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin…”
Get full text

Engineering the development of quantum programs: Application to the Boolean satisfiability problem by Alonso, Diego, Sánchez, Pedro, Sánchez-Rubio, Francisco

“…•New method for automatic generation of quantum code from SAT equations.•New metamodel for representing quantum circuits.•Formulas for calculating the number…”
Get full text

SAT-GATv2: A Dynamic Attention-Based Graph Neural Network for Solving Boolean Satisfiability Problem by Chang, Wenjing, Liu, Wenlong

“…We propose SAT-GATv2, a graph neural network (GNN)-based model designed to solve the Boolean satisfiability problem (SAT…”
Get full text

A quantum annealing approach for Boolean Satisfiability problem by Juexiao Su, Tianheng Tu, Lei He

“…Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT)…”
Get full text

Generic hardness of the Boolean satisfiability problem by Rybalov, Alexander

“…It follows from the famous result of Cook about the NP-completeness of the Boolean satisfiability problem that there is no polynomial algorithm for this problem…”
Get full text

Classified enhancement model for big data storage reliability based on Boolean satisfiability problem by Huang, Hong, Khan, Latifur, Zhou, Shaohua

“…Disk reliability is a serious problem in the big data foundation environment. Although the reliability of disk drives has greatly improved over the past few…”
Get full text

Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions by Semenov, Alexander, Zaikin, Oleg

“…In this paper we propose an approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT…”
Get full text

ON GENERIC NP-COMPLETENESS OF THE BOOLEAN SATISFIABILITY PROBLEM by Rybalov, A. N.

Get full text

Quantum Optimization with Arbitrary Connectivity Using Rydberg Atom Arrays by Nguyen, Minh-Thi, Liu, Jin-Guo, Wurtz, Jonathan, Lukin, Mikhail D., Wang, Sheng-Tao, Pichler, Hannes

“…Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et…”
Get full text

Finding all solutions of the Boolean satisfiability problem, if any, via Boolean-equation solving by Rushdi, Ali Muhammad Ali, Ahmad, Walid

“…Boolean Satisfiability (SAT) is the problem of deciding whether a propositional logic formula can be satisfied given suitable value assignments to the…”
Get full text

Dynamic Analog Circuit Netlisting for Solving the Boolean Satisfiability Problem by Singh, Sejal, Namrata, Bhavani, Hariharan, Venkatnarayan

“…Techniques to solve the Boolean Satisfiability problem (SAT) lend themselves to various applications in computer-aided design, circuit design, automated reasoning, formal verification, etc…”
Get full text

Accurate Modeling of Continuous-time SAT Solvers in SPICE by Pershin, Y. V., Nguyen, D. C.

“…Recently, there has been an increasing interest in employing dynamical systems as solvers of NP-complete problems. In this paper, we present accurate…”
Get full text

Multi-armed Bandit Algorithms for the Boolean Satisfiability Problem: A Survey by Xie, Zhihui, Liu, Xu, Li, Shuai

“…This paper provides a survey of recent literature on the use of multi-armed bandit algorithms to solve the Boolean satisfiability problem (SAT…”
Get full text

Parallel SAT framework to find clustering of differential characteristics and its applications by Sakamoto, Kosei, Ito, Ryoma, Isobe, Takanori

“…The most crucial but time-consuming task for differential cryptanalysis is to find a differential with a high probability. To tackle this task, we propose a…”
Get full text

Improving probability selection based weights for satisfiability problems by Fu, Huimin, Liu, Jun, Wu, Guanfeng, Xu, Yang, Sutcliffe, Geoff

“…Boolean Satisfiability problem (SAT) plays a prominent role in many domains of computer science and artificial intelligence due to its significant importance in both theory and applications…”
Get full text

Modeling Pairwise Test Generation from Cause-Effect Graphs as a Boolean Satisfiability Problem by Chung, Insang

“…A cause-effect graph considers only the desired external behavior of a system by identifying input-output parameter relationships in the specification. When…”
Get full text

Machine Learning Methods in Solving the Boolean Satisfiability Problem by Guo, Wenxuan, Junchi Yan, Hui-Ling, Zhen, Li, Xijun, Yuan, Mingxuan, Jin, Yaohui

“…This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT…”
Get full text

Context-sensitive fusion grammars and fusion grammars with forbidden context are universal by Lye, Aaron

“… In particular, we show that the Boolean satisfiability problem as well as the Post correspondence problem can be transformed into a context-sensitive fusion grammar and that the graph coloring…”
Get full text

Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better by Bennakhi, Ahmad, Byrd, Gregory T., Franzon, Paul

“… (Boolean satisfiability) problem. The quantum computing experiments were performed using…”
Get full text