A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm.
Michal KouckýVojtech RödlNavid TalebanfardPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- np hard
- detection algorithm
- learning algorithm
- computational complexity
- k means
- search space
- cost function
- optimization algorithm
- computational cost
- space complexity
- objective function
- satisfiability problem
- dynamic programming
- constraint satisfaction problems
- expectation maximization
- constraint satisfaction
- evolutionary algorithm
- tree decomposition