Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness.
Ivailo HartarskyTamás Róbert MezeiPublished in: SIAM J. Discret. Math. (2020)
Keyphrases
- np hardness
- np hard
- worst case
- computational complexity
- space complexity
- optimal solution
- learning algorithm
- average case
- knapsack problem
- discrete tomography
- linear program
- k means
- search space
- objective function
- computationally efficient
- special case
- decision problems
- partial order
- mixed integer
- lower bound
- reinforcement learning