A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm.
Michal KouckýVojtech RödlNavid TalebanfardPublished in: CoRR (2021)
Keyphrases
- cost function
- np hard
- dynamic programming
- optimization algorithm
- learning algorithm
- preprocessing
- matching algorithm
- combinatorial optimization
- space complexity
- k means
- randomly generated
- probabilistic model
- stochastic local search
- graph theory
- constraint satisfaction
- computational cost
- optimal solution
- objective function