
Search the dblp DataBase
Adam Klivans:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio
Learnability beyond AC0. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:26 [Conf]
 Adam Klivans, Amir Shpilka
Learning Arithmetic Circuits via Partial Derivatives. [Citation Graph (0, 0)][DBLP] COLT, 2003, pp:463476 [Conf]
 Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
Learning Intersections and Thresholds of Halfspaces. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:177186 [Conf]
 Adam Klivans, Rocco A. Servedio
Boosting and HardCore Sets. [Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:624633 [Conf]
 Adam Klivans
On the Derandomization of Constant Depth Circuits. [Citation Graph (0, 0)][DBLP] RANDOMAPPROX, 2001, pp:249260 [Conf]
 Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio
Learnability beyond AC0. [Citation Graph (0, 0)][DBLP] STOC, 2002, pp:776784 [Conf]
 Adam Klivans, Dieter van Melkebeek
Graph Nonisomorphism has Subexponential Size Proofs Unless the PolynomialTime Hierarchy Collapses. [Citation Graph (0, 0)][DBLP] STOC, 1999, pp:659667 [Conf]
 Adam Klivans, Daniel A. Spielman
Randomness efficient identity testing of multivariate polynomials. [Citation Graph (0, 0)][DBLP] STOC, 2001, pp:216223 [Conf]
 Adam Klivans, Rocco A. Servedio
Learning DNF in time 2^{Õ(n1/3)}. [Citation Graph (0, 0)][DBLP] STOC, 2001, pp:258265 [Conf]
 Adam Klivans, Dieter van Melkebeek
Graph Nonisomorphism Has Subexponential Size Proofs Unless the PolynomialTime Hierarchy Collapses. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:5, pp:15011526 [Journal]
An invariance principle for polytopes. [Citation Graph (, )][DBLP]
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. [Citation Graph (, )][DBLP]
Bounding the Sensitivity of Polynomial Threshold Functions [Citation Graph (, )][DBLP]
PolynomialTime Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
