Tensor network contractions for \#SAT (Q887094): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62584355, #quickstatements; #temporary_batch_1708296850199
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jacob M. Turner / rank
Normal rank
 
Property / author
 
Property / author: Jacob M. Turner / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1840046823 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.7375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving \#SAT using vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting truth assignments of formulas of bounded tree-width or clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating Quantum Computation by Contracting Tensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction with Bounded Treewidth Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor network states and geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel kets, entangled states, and the location of quantum information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraically contractible topological tensor network states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor network methods for invariant theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized counting constraint satisfaction problems with determinantal circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tensor calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rényi entropies as a measure of the complexity of counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Local Hamiltonian Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an algebraic theory of Boolean circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the r,s-SAT satisfiability problem and a conjecture of Tovey / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of counting problems on 3-regular planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3633642 / rank
 
Normal rank

Latest revision as of 00:00, 11 July 2024

scientific article
Language Label Description Also known as
English
Tensor network contractions for \#SAT
scientific article

    Statements

    Tensor network contractions for \#SAT (English)
    0 references
    0 references
    0 references
    0 references
    28 October 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    statistical physics
    0 references
    complexity
    0 references
    computational physics
    0 references
    quantum physics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references