The computational hardness of counting in two-spin models on d-regular graphs

Allan Sly Nike Sun

Published in: CoRR (2012)

Keyphrases

probabilistic model
experimental data
computational models
neural network
parameter estimation
bayesian networks
np complete
process model
statistical models
classification models
graph theory
parametric models
fully connected
biological plausibility