- Baum's Algorithm Learns Intersections of Halfspaces with respect to Log-Concave Distributions
- A Query Algorithm for Agnostically Learning DNF? Parikshit Gopalan
- List-Decoding Reed-Muller Codes over Small Fields Parikshit Gopalan
- In Proc. of 20th Conference on Learning Theory (COLT), June 2007. A Lower Bound for Agnostically Learning Disjunctions
- Cryptographic Hardness for Learning Intersections of Halfspaces
- Unconditional Lower Bounds for Learning Intersections of Halfspaces
- Agnostically Learning Halfspaces Adam Tauman Kalai
- CS 395T Computational Complexity of Machine Learning Lecture 3: January 27, 2005 Lecturer: Adam Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 14: March 8, 2005 Lecturer: Adam Klivans
- Learning Intersections of Halfspaces with a Margin Adam R. Klivans
- On the Derandomization of Constant Depth Adam R. Klivans ?
- E#cient Learning Algorithms Yield Circuit Lower Bounds
- CS 395T Computational Complexity of Machine Learning Lecture 9: February 17, 2005 Lecturer: Adam Klivans
- GRAPH NONISOMORPHISM HAS SUBEXPONENTIAL SIZE PROOFS UNLESS THE POLYNOMIAL-TIME HIERARCHY
- CS 395T Computational Complexity of Machine Learning Lecture 17: March 24, 2005 Lecturer: Adam Klivans
- Learning Intersections and Thresholds of Halfspaces Adam R. Klivans #
- Randomness Ecient Identity Testing of Multivariate Polynomials
- Learning DNF in Time 2 ~ Adam R. Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 2: January 25, 2005 Lecturer: Adam Klivans
- Toward Attribute Ecient Learning Algorithms Adam R. Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 18: March 28, 2005 Lecturer: Adam Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 4: February 1, 2005 Lecturer: Adam Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 7: February 10, 2005 Lecturer: Adam Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 8: Febrary 15, 2005 Lecturer: Adam Klivans
- CS 357 Algorithms Lecture 10: February 22, 2005 Lecturer: Adam Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 6: February 8, 2005 Lecturer: Adam Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 15: March 10, 2005 Lecturer: Adam Klivans
- CS 395T Computational Complexity of Machine Learning Lecture 20: April 4, 2005 Lecturer: Adam Klivans
- A Complexity Theoretic Approach to Learning Adam Richard Klivans
- Learning Arithmetic Circuits via Partial Derivatives Adam R. Klivans 1 and Amir Shpilka 2
- New Results on Hardness of Proper Learning and Beyond Misha Alekhnovich #
- CS 395T Computational Complexity of Machine Learning Lecture 13: March 3, 2005 Lecturer: Adam Klivans
- Learning Geometric Concepts via Gaussian Surface Area Adam R. Klivans
- NP with Small Advice Lance Fortnow
- CS 395T Computational Complexity of Machine Learning Lecture 11: February 24, 2005 Lecturer: Adam Klivans
- Linear Advice for Randomized Logarithmic Space Lance Fortnow
- Agnostically Learning Decision Trees Parikshit Gopalan
- Lecture 5: Voting Polynomials Scribe: JingTang Keith Jang
- Learnability Beyond AC 0 Je rey C. Jackson
- CS 395T Computational Complexity of Machine Learning Lecture 12: March 1, 2005 Lecturer: Adam Klivans
- Perceptron-Like Performance for Intersections of Adam R. Klivans 1 and Rocco A. Servedio 2
- CS 395T Computational Complexity of Machine Learning Lecture 19: March 31, 2005 Lecturer: Adam Klivans
- Graph Nonisomorphism Has Subexponential Size Proofs Unless The PolynomialTime Hierarchy Collapses
- Boosting and HardCore Sets Adam R. Klivans
- Learning Halfspaces with Malicious Noise Adam R. Klivans, Philip M. Long, and Rocco A. Servedio
- An FPTAS for #Knapsack and Related Counting Problems Parikshit Gopalan Adam Klivans Raghu Meka Daniel Stefankovic Santosh Vempala Eric Vigoda