Adam R. Klivans

Available identifiers

zbMath Open klivans.adam-rMaRDI QIDQ598255

List of research outcomes

Publication	Date of Publication	Type
A moment-matching approach to testable learning and a new characterization of Rademacher complexity	2024-05-08	Paper
Preserving Randomness for Adaptive Algorithms	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5743502	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q2969663	2017-03-22	Paper
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses	2016-09-29	Paper
Randomness efficient identity testing of multivariate polynomials	2015-02-27	Paper
Learning DNF in time	2015-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q3191612	2014-10-06	Paper
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions	2014-08-13	Paper
An invariance principle for polytopes	2014-08-13	Paper
An FPTAS for #Knapsack and Related Counting Problems	2014-07-30	Paper
An invariance principle for polytopes	2014-02-17	Paper
An Explicit VC-Theorem for Low-Degree Polynomials	2012-11-02	Paper
Learning halfspaces with malicious noise	2012-04-17	Paper
https://portal.mardi4nfdi.de/entity/Q3093360	2011-10-12	Paper
https://portal.mardi4nfdi.de/entity/Q3002772	2011-05-24	Paper
Lower bounds for agnostic learning via approximate rank	2011-02-18	Paper
Learnability beyond AC 0	2010-08-05	Paper
Learning Theory and Kernel Machines	2010-03-23	Paper
Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions	2009-10-28	Paper
Learning Halfspaces with Malicious Noise	2009-07-14	Paper
Unconditional lower bounds for learning intersections of halfspaces	2009-03-31	Paper
Cryptographic hardness for learning intersections of halfspaces	2009-01-09	Paper
Efficient learning algorithms yield circuit lower bounds	2009-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q5302076	2009-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q3549710	2009-01-05	Paper
Agnostically Learning Halfspaces	2008-12-22	Paper
Linear Advice for Randomized Logarithmic Space	2008-03-19	Paper
A Lower Bound for Agnostically Learning Disjunctions	2008-01-03	Paper
The complexity of properly learning simple concept classes	2007-11-30	Paper
Learning intersections of halfspaces with a margin	2007-11-30	Paper
Efficient Learning Algorithms Yield Circuit Lower Bounds	2007-09-14	Paper
Improved Lower Bounds for Learning Intersections of Halfspaces	2007-09-14	Paper
Learning Theory	2005-06-13	Paper
Learning Theory	2005-06-13	Paper
Learning Theory	2005-06-13	Paper
Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)	2004-11-22	Paper
Learning intersections and thresholds of halfspaces	2004-08-06	Paper
Boosting and hard-core set construction	2003-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q4780799	2002-11-21	Paper
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses	2002-09-29	Paper

Research outcomes over time

This page was built for person: Adam R. Klivans