Netrunner Mate-in-1 or -2 is Weakly NP-Hard.
Jeffrey BosboomMichael HoffmannPublished in: CoRR (2017)
Keyphrases
- approximation ratio
- np hard
- approximation algorithms
- special case
- scheduling problem
- np hardness
- lower bound
- minimum cost
- linear programming
- integer programming
- optimal solution
- closely related
- approximate solutions
- feature selection
- decision problems
- helmholtz principle
- computational complexity
- branch and bound algorithm
- worst case
- search space
- randomly generated problem instances
- min sum
- finding the optimal solution
- computationally challenging
- np hard problems
- greedy heuristic
- constraint satisfaction problems
- website