NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors.
Amey BhangalePublished in: Electron. Colloquium Comput. Complex. (2018)
Keyphrases
- np hardness
- np hard
- approximation algorithms
- color images
- color space
- mixed integer
- worst case analysis
- hypergraph model
- special case
- higher order
- pairwise
- discrete tomography
- optimal solution
- linear programming
- lower bound
- linear program
- sample complexity
- scheduling problem
- decision making
- dynamic programming
- active learning
- bayesian networks