Login / Signup
Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard.
Ivailo Hartarsky
Tamás Róbert Mezei
Published in:
CoRR (2018)
Keyphrases
</>
np hard
probabilistic model
machine learning
special case
scheduling problem
parameter estimation
website
computational complexity
worst case
statistical model
statistical models
neural network model