NOTICE: SMARTech content freeze Dec. 10 - 17. The Library will be unable to deposit or edit content during this scheduled maintenance
Now showing items 1-1 of 1
Intractability Results for some Computational Problems
(Georgia Institute of Technology, 2008-07-08)
In this thesis, we show results for some well-studied problems from learning theory and combinatorial optimization. Learning Parities under the Uniform Distribution: We study the learnability of parities in the agnostic ...