Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract)

Authors:
Sorin Istrail
Affiliations:
Sandia National Laboratories, Applied Mathematics Department, MS 1110, Albuquerque, NM
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Citing 3
Cited 9

Polynomial-time approximation algorithms for the Ising model

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Complexity: knots, colourings and counting

Complexity: knots, colourings and counting
Matching Theory (North-Holland mathematics studies)

Matching Theory (North-Holland mathematics studies)

Computational Complexity for Physicists

Computing in Science and Engineering
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

Theoretical Computer Science
SIGACT News complexity theory column 41

ACM SIGACT News
Cellular neural networks for NP-hard optimization

EURASIP Journal on Advances in Signal Processing - CNN technology for spatiotemporal signal processing
Exponential time complexity of the permanent and the Tutte polynomial

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Stochastic minority on graphs

Theoretical Computer Science
Global adaptation in networks of selfish components: Emergent associative memory at the system scale

Artificial Life
Investigating the performance of an adiabatic quantum optimization processor

Quantum Information Processing
An exact tensor network for the 3SAT problem

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract