Výsledky vyhledávání - (("boolean satisfiability problem") OR ("boolean satisfiability problems"))~

  1. 1

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

    ISSN: 2691-3399, 2691-3399
    Vydáno: American Physical Society 01.09.2024
    Vydá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. 2

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

    ISSN: 2731-538X, 2153-182X, 2731-5398, 2153-1838
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2023
    Vydá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. 3

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

    ISSN: 2045-2322, 2045-2322
    Vydáno: London Nature Publishing Group UK 12.11.2020
    Vydá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. 4

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

    ISSN: 2227-7390, 2227-7390
    Vydáno: Basel MDPI AG 01.01.2023
    Vydá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. 5

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

    ISSN: 0965-9978
    Vydáno: Elsevier Ltd 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. 6

    Solving Boolean satisfiability problems with resistive content addressable memories Autor 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

    ISSN: 3004-8672, 3004-8672
    Vydáno: London Nature Publishing Group UK 02.04.2025
    Vydá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. 7

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

    ISSN: 2079-9292, 2079-9292
    Vydáno: Basel MDPI AG 01.02.2025
    Vydá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. 8

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

    ISSN: 2158-9682
    Vydáno: JSAP 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. 9

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

    Vydáno: IEEE 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. 10

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

    ISSN: 2152-3630
    Vydáno: IEEE 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. 11

    Generic hardness of the Boolean satisfiability problem Autor Rybalov, Alexander

    ISSN: 1867-1144, 1869-6104
    Vydáno: Berlin De Gruyter 01.11.2017
    Vydá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. 12

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

    ISSN: 1386-7857, 1573-7543
    Vydáno: New York Springer US 01.06.2020
    Vydá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. 13

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

    Vydáno: Croatian Society 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. 14

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

    ISSN: 2193-1801, 2193-1801
    Vydáno: Cham Springer International Publishing 30.04.2016
    Vydá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. 15

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

    ISSN: 2623-8764
    Vydáno: Croatian Society 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. 16

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

    ISSN: 2376-8606
    Vydáno: IEEE 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. 17
  18. 18

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

    ISSN: 1875-6891, 1875-6883, 1875-6883
    Vydáno: Dordrecht Springer Netherlands 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. 19

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

    ISSN: 2470-0053, 2470-0053
    Vydáno: United States 01.05.2016
    Vydá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. 20

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

    ISSN: 2691-3399, 2691-3399
    Vydáno: United States American Physical Society (APS) 14.02.2023
    Vydá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