Concepedia

The Complexity of Approximating complex-valued Ising and Tutte partition functions

Leslie Ann Goldberg, Heng Guo

Computational Complexity · 2017 · 52 citations · 26 references

DOIFull text

Open access

Concepts

References

26

The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

J. Scott Provan, Michael O. Ball · SIAM Journal on Computing · 1983 · 753 citations

, , +14

Topological quantum computation

Michael Freedman, Alexei Kitaev, Michael Larsen et al. · Bulletin of the American Mathematical Society · 2002 · 670 citations · Full text

, , +14

NP is as easy as detecting unique solutions

Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 659 citations

, , +4

Polynomial-Time Approximation Algorithms for the Ising Model

Mark Jerrum, Alistair Sinclair · SIAM Journal on Computing · 1993 · 579 citations

, , +16

A Modular Functor Which is Universal¶for Quantum Computation

Michael Freedman, Michael Larsen, Zhenghan Wang · Communications in Mathematical Physics · 2002 · 532 citations

, , +11