Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT.
Paul BeameRussell ImpagliazzoSrikanth SrinivasanPublished in: Computational Complexity Conference (2012)
Keyphrases
- decision trees
- learning algorithm
- detection algorithm
- cost function
- computational complexity
- simulated annealing
- matching algorithm
- computational cost
- dynamic programming
- optimization algorithm
- segmentation algorithm
- preprocessing
- optimal solution
- probabilistic model
- worst case
- k means
- search algorithm
- training data
- space complexity