Recognizing binary shuffle squares is NP-hard.
Laurent BulteauStéphane VialettePublished in: Theor. Comput. Sci. (2020)
Keyphrases
- np hard
- optimal solution
- lower bound
- special case
- scheduling problem
- approximation algorithms
- binary variables
- closely related
- np hardness
- np complete
- constraint satisfaction problems
- linear programming
- branch and bound algorithm
- knapsack problem
- integer programming
- minimum cost
- non binary
- automatic recognition
- remains np hard
- computationally hard
- gray code
- real time
- hough transform
- upper bound
- e learning
- worst case
- multiscale
- set cover
- computer vision
- machine learning