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

@@ Property / OpenAlex ID @@
+W1840046823
@@ Property / OpenAlex ID: W1840046823 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7375
@@ Property / arXiv ID: 1405.7375 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Determining computational complexity from characteristic ‘phase transitions’
+Normal rank
@@ Property / cites work @@
+A threshold for unsatisfiability
@@ Property / cites work: A threshold for unsatisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Critical Behavior in the Satisfiability of Random Boolean Expressions
+Normal rank
@@ Property / cites work @@
+Solving \#SAT using vertex covers
@@ Property / cites work: Solving \#SAT using vertex covers / rank @@
+Normal rank
@@ Property / cites work @@
+Counting truth assignments of formulas of bounded tree-width or clique-width
+Normal rank
@@ Property / cites work @@
+Simulating Quantum Computation by Contracting Tensor Networks
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction with Bounded Treewidth Revisited
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Tensor network states and geometry
@@ Property / cites work: Tensor network states and geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q5620163
@@ Property / cites work: Q5620163 / rank @@
+Normal rank
@@ Property / cites work @@
+Channel kets, entangled states, and the location of quantum information
+Normal rank
@@ Property / cites work @@
+Algebraically contractible topological tensor network states
+Normal rank
@@ Property / cites work @@
+Tensor network methods for invariant theory
@@ Property / cites work: Tensor network methods for invariant theory / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized counting constraint satisfaction problems with determinantal circuits
+Normal rank
@@ Property / cites work @@
+Q3166129
@@ Property / cites work: Q3166129 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of tensor calculus
@@ Property / cites work: The complexity of tensor calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Rényi entropies as a measure of the complexity of counting problems
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of the Local Hamiltonian Problem
@@ Property / cites work: The Complexity of the Local Hamiltonian Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Towards an algebraic theory of Boolean circuits.
@@ Property / cites work: Towards an algebraic theory of Boolean circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the r,s-SAT satisfiability problem and a conjecture of Tovey
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4734791
@@ Property / cites work: Q4734791 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of counting problems on 3-regular planar graphs
+Normal rank
@@ Property / cites work @@
+Q3292859
@@ Property / cites work: Q3292859 / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3633642
@@ Property / cites work: Q3633642 / rank @@
+Normal rank