Login / Signup
The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs.
Allan Sly
Nike Sun
Published in:
FOCS (2012)
Keyphrases
</>
computational models
probabilistic model
experimental data
statistical models
machine learning
graph representation
fully connected
database
search algorithm
process model
classification models
graph model
graph theoretic
random graphs