Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem.
Tobias RiegeJörg RothePublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- randomized algorithm
- computational complexity
- randomized algorithms
- small number
- data structure
- execution times
- black box
- memory requirements
- worst case
- orders of magnitude
- run times
- optimization problems
- computationally efficient
- stochastic local search
- times faster
- neural network
- np complete
- lower bound
- knowledge base
- learning algorithm