Suchergebnisse - (("boolean satisfiability problem") OR ("boolean satisfiability problems"))

Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm von Boulebnane, Sami, Montanaro, Ashley

“… One of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses …”
Volltext

Machine Learning Methods in Solving the Boolean Satisfiability Problem von 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 …”
Volltext

Efficient solution of Boolean satisfiability problems with digital memcomputing von Bearden, Sean R. B., Pei, Yan Ru, Di Ventra, Massimiliano

“… Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of …”
Volltext

Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem von 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 …”
Volltext

Engineering the development of quantum programs: Application to the Boolean satisfiability problem von 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 …”
Volltext

Solving Boolean satisfiability problems with resistive content addressable memories von Pedretti, Giacomo, Böhm, Fabian, Bhattacharya, Tinish, Heittmann, Arne, Zhang, Xiangyi, Hizzani, Mohammad, Hutchinson, George, Kwon, Dongseok, Moon, John, Valiante, Elisabetta, Rozada, Ignacio, Graves, Catherine E., Ignowski, Jim, Mohseni, Masoud, Strachan, John Paul, Strukov, Dmitri, Beausoleil, Ray, Van Vaerenbergh, Thomas

“… Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to …”
Volltext

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

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

A Fully Integrated Mixed-Signal Compute-In-Memory Accelerator for Solving Arbitrary Order Boolean Satisfiability Problems von Bhattacharya, Tinish, Kwon, Dongseok, Hutchinson, George Higgins, Zhang, Xiangyi, Rozada, Ignacio, Strukov, Dmitri

“… This paper presents a mixed-signal In-Memory Computing (IMC) accelerator with 256 \times 128 10T bi-directional SRAM array in 55 nm CMOS process, for solving …”
Volltext

A quantum annealing approach for Boolean Satisfiability problem von 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) …”
Volltext

A Reconfigurable lsing Machine for Boolean Satisfiability Problems Featuring Many-Body Spin Interactions von Su, Yuqi, Kim, Tony Tae-Hyoung, Kim, Bongjin

“… Ising machines [1-6] have recently shown their unique capabilities in solving hard combinatorial optimization problems (COPs) intractable using conventional …”
Volltext

Generic hardness of the Boolean satisfiability problem von 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 …”
Volltext

Classified enhancement model for big data storage reliability based on Boolean satisfiability problem von 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 …”
Volltext

Scalable parallel solver of boolean satisfiability problems von Bogdanova, V. G., Gorsky, S. A.

“… One of the current trends in high-performance computing (HPC) is applying its possibilities to solve the Boolean satisfiability problem (SAT …”
Volltext

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

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

HPC-based parallel software for solving applied Boolean satisfiability problems von Bogdanova, V.G., Gorsky, S.A., Pashinin, A.A.

“… NP-complexity of the Boolean satisfiability problem actualizes the development of parallel software for solving it in a high-performance computing environment …”
Volltext

29.2 Snap-SAT: A One-Shot Energy-Performance-Aware All-Digital Compute-in-Memory Solver for Large-Scale Hard Boolean Satisfiability Problems von Xie, Shanshan, Yang, Mengtian, Lanham, S. Andrew, Wang, Yipeng, Wang, Meizhi, Oruganti, Sirish, Kulkarni, Jaydeep P.

“… Boolean satisfiability (SAT) is a non-deterministic polynomial time (NP)-complete problem with many practical and industrial data-intensive applications [1] …”
Volltext

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

Volltext

A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems von Chen, Qingshan, Xu, Yang, Liu, Jun, He, Xingxing

“… Clause learning is the key component of modern SAT solvers, while conflict analysis based on the implication graph is the mainstream technology to generate the …”
Volltext

Order-to-chaos transition in the hardness of random Boolean satisfiability problems von Varga, Melinda, Sumi, Róbert, Toroczkai, Zoltán, Ercsey-Ravasz, Mária

“… Transient chaos is a ubiquitous phenomenon characterizing the dynamics of phase-space trajectories evolving towards a steady-state attractor in physical …”
Weitere Angaben

Quantum Optimization with Arbitrary Connectivity Using Rydberg Atom Arrays von 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 …”
Volltext