Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem.
Tobias RiegeJörg RothePublished in: J. Univers. Comput. Sci. (2006)
Keyphrases
- computational complexity
- randomized algorithm
- randomized algorithms
- small number
- execution times
- learning algorithm
- significant improvement
- times faster
- orders of magnitude
- running times
- space complexity
- phase transition
- machine learning algorithms
- machine learning
- memory requirements
- propositional logic
- theoretical analysis
- np complete
- optimization problems
- computational cost
- reinforcement learning
- polynomial time complexity