Constructing SAT Filters with a Quantum Annealer (Q3453216): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2184665873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space/time trade-offs in hash coding with allowable errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor-embedding in adiabatic quantum computation. I: The parameter setting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ising Model Inspired Extension of the Product-Based MP Framework for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of 1 + α for Memory-Efficient Bloom Filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space Lower Bound for Dynamic Approximate Membership Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction on trees and spin glass transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Bloom Filter Replacement Based on Matrix Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3194805 / rank
 
Normal rank

Latest revision as of 03:25, 11 July 2024

scientific article
Language Label Description Also known as
English
Constructing SAT Filters with a Quantum Annealer
scientific article

    Statements

    Constructing SAT Filters with a Quantum Annealer (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    SAT filter
    0 references
    quantum annealing
    0 references
    Ising model
    0 references
    maximum cut
    0 references
    sampling
    0 references
    constraint satisfaction problem
    0 references
    0 references
    0 references
    0 references
    0 references