The paper asserts, without a rigorous derivation, an O(2^mn) lower bound on the computational complexity of the spin-glass 3D Ising model.
inside and outside
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.gen-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Computational complexity of spin-glass three-dimensional (3D) Ising model
The paper asserts, without a rigorous derivation, an O(2^mn) lower bound on the computational complexity of the spin-glass 3D Ising model.