Tensor network contractions for \#SAT
From MaRDI portal
Publication:887094
DOI10.1007/s10955-015-1276-zzbMath1341.68053arXiv1405.7375OpenAlexW1840046823WikidataQ62584355 ScholiaQ62584355MaRDI QIDQ887094
Jason Morton, Jacob D. Biamonte, Jacob M. Turner
Publication date: 28 October 2015
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.7375
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks ⋮ Probabilistic nonunitary gate in imaginary time evolution ⋮ Unnamed Item ⋮ Hand-waving and interpretive dance: an introductory course on tensor networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Generalized counting constraint satisfaction problems with determinantal circuits
- The complexity of computing the permanent
- Tensor network states and geometry
- A threshold for unsatisfiability
- A simplified NP-complete satisfiability problem
- NP is as easy as detecting unique solutions
- S-functions for graphs
- Towards an algebraic theory of Boolean circuits.
- The complexity of tensor calculus
- On the r,s-SAT satisfiability problem and a conjecture of Tovey
- Computational complexity of counting problems on 3-regular planar graphs
- Solving \#SAT using vertex covers
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Tensor network methods for invariant theory
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Channel kets, entangled states, and the location of quantum information
- Algebraically contractible topological tensor network states
- Rényi entropies as a measure of the complexity of counting problems
- Constraint Satisfaction with Bounded Treewidth Revisited
- Simulating Quantum Computation by Contracting Tensor Networks
- The Complexity of Enumeration and Reliability Problems
- Determining computational complexity from characteristic ‘phase transitions’
- The Complexity of the Local Hamiltonian Problem
This page was built for publication: Tensor network contractions for \#SAT
