Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey.
Tobias RiegeJörg RothePublished in: J. Univers. Comput. Sci. (2006)
Keyphrases
- small number
- maximum number
- exact solution
- neural network
- search algorithm
- computational complexity
- optimization problems
- graphical models
- run times
- exact and approximate
- practical problems
- connected components
- hierarchical structure
- np complete
- objective function
- reinforcement learning
- learning algorithm
- information retrieval