Fetching the paper…
Reading the bibliography…
The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify.
On measures of entropy and information
Alfréd Rényi · 1961
Earlier work this paper cites.
The theory of quantized directions
Roger Penrose · 1967
Earlier work this paper cites.
Applications of negative dimensional tensors
Roger Penrose · 1971
Earlier work this paper cites.
S-functions for graphs
Rudolf Halin · 1976
Earlier work this paper cites.
The complexity of enumeration and reliability problems
Leslie G Valiant · 1979
Earlier work this paper cites.
The complexity of computing the permanent
Leslie G Valiant · 1979
Earlier work this paper cites.
On the computational complexity of ising spin glass models
F Barahona · 1982
Earlier work this paper cites.
Optimization by simulated annealing
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi · 1983
Earlier work this paper cites.
A simplified NP-complete satisfiability problem
Craig A Tovey · 1984
Earlier work this paper cites.
NP is as easy as detecting unique solutions
Leslie G Valiant and Vijay V Vazirani · 1986
Earlier work this paper cites.
Local computations with probabilities on graphical structures and their application to expert systems
Steffen L Lauritzen and David J Spiegelhalter · 1988
Earlier work this paper cites.
On the r,s-SAT satisfiability problem and a conjecture of tovey
Olivier Dubois · 1990
Earlier work this paper cites.
Critical behavior in the satisfiability of random boolean expressions
Scott Kirkpatrick and Bart Selman · 1994
Earlier work this paper cites.
A threshold for unsatisfiability
Andreas Goerdt · 1996
Earlier work this paper cites.
Determining computational complexity from characteristic ‘phase transitions’
Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, and Lidror Troyansky · 1999
Earlier work this paper cites.
The complexity of tensor calculus
C. Damm, M. Holzer, and P. McKenzie · 2003
Earlier work this paper cites.
Algorithms and complexity results for# sat and bayesian inference
Fahiem Bacchus, Shannon Dalmao, and Toniann Pitassi · 2003
Cited alongside, same era.
Channel kets, entangled states, and the location of quantum information
R. B. Griffiths · 2005
Cited alongside, same era.
Atemporal diagrams for quantum circuits
R. B. Griffiths, S. Wu, L. Yu, and S. M. Cohen · 2006
Cited alongside, same era.
The complexity of the local hamiltonian problem
Julia Kempe, Alexei Kitaev, and Oded Regev · 2006
Cited alongside, same era.
A fixed-parameter algorithm for #SAT with parameter incidence treewidth
Marko Samer and Stefan Szeider · 2006
Cited alongside, same era.
Novel Schemes for Measurement-Based Quantum Computation
D. Gross and J. Eisert · 2007
Cited alongside, same era.
Are problems in quantum information theory (un) decidable?
Michael M Wolf, Toby S Cubitt, and David Perez-Garcia · 2011
Later among the works it cites.
Renyi Entropy and Free Energy
J. C. Baez · 2011
Later among the works it cites.
Virtual Parallel Computing and a Search Algorithm Using Matrix Product States
C. Chamon and E. R. Mucciolo · 2012
Later among the works it cites.
Undecidability in tensor network states
J. Morton and J. Biamonte · 2012
Later among the works it cites.
Quantum measurement occurrence is undecidable
J. Eisert, M. P. Müller, and C. Gogolin · 2012
Later among the works it cites.
Algebraically contractible topological tensor network states
S. J. Denny, J. D. Biamonte, D. Jaksch, and S. R. Clark · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Computational complexity of counting problems on 3-regular planar graphs
Mingji Xia, Peng Zhang, and Wenbo Zhao · 2007
Cited alongside, same era.
Solving# sat using vertex covers
Naomi Nishimura, Prabhakar Ragde, and Stefan Szeider · 2007
Cited alongside, same era.
Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems
F. Verstraete, V. Murg, and J. I. Cirac · 2008
Cited alongside, same era.
Nonperturbative k -body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
J. D. Biamonte · 2008
Cited alongside, same era.
Simulating quantum computation by contracting tensor networks
Igor L Markov and Yaoyun Shi · 2008
Cited alongside, same era.
Counting truth assignments of formulas of bounded tree-width or clique-width
Eldar Fischer, Johann A Makowsky, and Elena V Ravve · 2008
Cited alongside, same era.
Ground-state spin logic
J. D. Whitfield, M. Faccin, and J. D. Biamonte · 2012
Later among the works it cites.
An exact tensor network for the 3SAT problem
Artur García-Sáez and José I Latorre · 2012
Later among the works it cites.
Entanglement and tensor network states
J. Eisert · 2013
Later among the works it cites.
Solving search problems by strongly simulating quantum circuits
T. H. Johnson, J. D. Biamonte, S. R. Clark, and D. Jaksch · 2013
Later among the works it cites.
Generalized Counting Constraint Satisfaction Problems With Determinantal Circuits
J. Morton and J. Turner · 2013
Later among the works it cites.
Rényi entropies as a measure of the complexity of counting problems
C. Chamon and E. R. Mucciolo · 2013
Later among the works it cites.
Tensor networks for frustrated systems: emergence of order from simplex entanglement
D. Alsina and J. I. Latorre · 2013
Later among the works it cites.
Tensor network methods for invariant theory
J. Biamonte, V. Bergholm, and M. Lanzagorta · 2013
Later among the works it cites.
Matrix product operators and states - NP-hardness and undecidability
M. Kliesch, D. Gross, and J. Eisert · 2014
Closest in time.
Tensor network non-zero testing
S. Gharibian, Z. Landau, S. W. Shin, and G. Wang · 2014
Closest in time.