The Hardness of 3-Uniform Hypergraph Coloring.
Irit DinurOded RegevClifford D. SmythPublished in: Comb. (2005)
Keyphrases
- np hard
- computational complexity
- higher order
- np hardness
- phase transition
- pairwise
- data sets
- hypergraph model
- computer vision
- information retrieval
- real time
- image sequences
- bayesian networks
- objective function
- multi agent systems
- database systems
- decision trees
- social networks
- mutual information
- information theoretic
- databases