Výsledky vyhledávání - (("boolean satisfiability problem") OR ("boolean satisfiability problems"))~
-
1
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
ISSN: 2691-3399, 2691-3399Vydáno: American Physical Society 01.09.2024Vydáno v PRX quantum (01.09.2024)“…One of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses…”
Získat plný text
Journal Article -
2
Machine Learning Methods in Solving the Boolean Satisfiability Problem
ISSN: 2731-538X, 2153-182X, 2731-5398, 2153-1838Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2023Vydáno v Machine Intelligence Research (01.10.2023)“…This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT…”
Získat plný text
Journal Article -
3
Efficient solution of Boolean satisfiability problems with digital memcomputing
ISSN: 2045-2322, 2045-2322Vydáno: London Nature Publishing Group UK 12.11.2020Vydáno v Scientific reports (12.11.2020)“…Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of…”
Získat plný text
Journal Article -
4
Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
ISSN: 2227-7390, 2227-7390Vydáno: Basel MDPI AG 01.01.2023Vydáno v Mathematics (Basel) (01.01.2023)“…The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin…”
Získat plný text
Journal Article -
5
Engineering the development of quantum programs: Application to the Boolean satisfiability problem
ISSN: 0965-9978Vydáno: Elsevier Ltd 01.11.2022Vydáno v Advances in engineering software (1992) (01.11.2022)“…•New method for automatic generation of quantum code from SAT equations.•New metamodel for representing quantum circuits.•Formulas for calculating the number…”
Získat plný text
Journal Article -
6
Solving Boolean satisfiability problems with resistive content addressable memories
ISSN: 3004-8672, 3004-8672Vydáno: London Nature Publishing Group UK 02.04.2025Vydáno v Npj unconventional computing (02.04.2025)“…Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to…”
Získat plný text
Journal Article -
7
SAT-GATv2: A Dynamic Attention-Based Graph Neural Network for Solving Boolean Satisfiability Problem
ISSN: 2079-9292, 2079-9292Vydáno: Basel MDPI AG 01.02.2025Vydáno v Electronics (Basel) (01.02.2025)“…We propose SAT-GATv2, a graph neural network (GNN)-based model designed to solve the Boolean satisfiability problem (SAT…”
Získat plný text
Journal Article -
8
A Fully Integrated Mixed-Signal Compute-In-Memory Accelerator for Solving Arbitrary Order Boolean Satisfiability Problems
ISSN: 2158-9682Vydáno: JSAP 08.06.2025Vydáno v Digest of technical papers - Symposium on VLSI Technology (08.06.2025)“…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…”
Získat plný text
Konferenční příspěvek -
9
A quantum annealing approach for Boolean Satisfiability problem
Vydáno: IEEE 05.06.2016Vydáno v 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC) (05.06.2016)“…Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT)…”
Získat plný text
Konferenční příspěvek -
10
A Reconfigurable lsing Machine for Boolean Satisfiability Problems Featuring Many-Body Spin Interactions
ISSN: 2152-3630Vydáno: IEEE 01.04.2023Vydáno v Proceedings of the Custom Integrated Circuits Conference (01.04.2023)“…Ising machines [1-6] have recently shown their unique capabilities in solving hard combinatorial optimization problems (COPs) intractable using conventional…”
Získat plný text
Konferenční příspěvek -
11
Generic hardness of the Boolean satisfiability problem
ISSN: 1867-1144, 1869-6104Vydáno: Berlin De Gruyter 01.11.2017Vydáno v Groups, complexity, cryptology (01.11.2017)“…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…”
Získat plný text
Journal Article -
12
Classified enhancement model for big data storage reliability based on Boolean satisfiability problem
ISSN: 1386-7857, 1573-7543Vydáno: New York Springer US 01.06.2020Vydáno v Cluster computing (01.06.2020)“…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…”
Získat plný text
Journal Article -
13
Scalable parallel solver of boolean satisfiability problems
Vydáno: Croatian Society MIPRO 01.05.2018Vydáno v 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO) (01.05.2018)“…One of the current trends in high-performance computing (HPC) is applying its possibilities to solve the Boolean satisfiability problem (SAT…”
Získat plný text
Konferenční příspěvek -
14
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
ISSN: 2193-1801, 2193-1801Vydáno: Cham Springer International Publishing 30.04.2016Vydáno v SpringerPlus (30.04.2016)“…In this paper we propose an approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT…”
Získat plný text
Journal Article -
15
HPC-based parallel software for solving applied Boolean satisfiability problems
ISSN: 2623-8764Vydáno: Croatian Society MIPRO 28.09.2020Vydáno v 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO) (28.09.2020)“… NP-complexity of the Boolean satisfiability problem actualizes the development of parallel software for solving it in a high-performance computing environment…”
Získat plný text
Konferenční příspěvek -
16
29.2 Snap-SAT: A One-Shot Energy-Performance-Aware All-Digital Compute-in-Memory Solver for Large-Scale Hard Boolean Satisfiability Problems
ISSN: 2376-8606Vydáno: IEEE 19.02.2023Vydáno v Digest of technical papers - IEEE International Solid-State Circuits Conference (19.02.2023)“…Boolean satisfiability (SAT) is a non-deterministic polynomial time (NP)-complete problem with many practical and industrial data-intensive applications [1]…”
Získat plný text
Konferenční příspěvek -
17
ON GENERIC NP-COMPLETENESS OF THE BOOLEAN SATISFIABILITY PROBLEM
ISSN: 2071-0410Vydáno: 01.06.2017Vydáno v Prikladnaya diskretnaya matematika (01.06.2017)Získat plný text
Journal Article -
18
A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems
ISSN: 1875-6891, 1875-6883, 1875-6883Vydáno: Dordrecht Springer Netherlands 01.01.2017Vydáno v International journal of computational intelligence systems (01.01.2017)“…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…”
Získat plný text
Journal Article -
19
Order-to-chaos transition in the hardness of random Boolean satisfiability problems
ISSN: 2470-0053, 2470-0053Vydáno: United States 01.05.2016Vydáno v Physical review. E (01.05.2016)“…Transient chaos is a ubiquitous phenomenon characterizing the dynamics of phase-space trajectories evolving towards a steady-state attractor in physical…”
Zjistit podrobnosti o přístupu
Journal Article -
20
Quantum Optimization with Arbitrary Connectivity Using Rydberg Atom Arrays
ISSN: 2691-3399, 2691-3399Vydáno: United States American Physical Society (APS) 14.02.2023Vydáno v PRX quantum (14.02.2023)“…Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et…”
Získat plný text
Journal Article