The following pages link to Adam R. Klivans (Q598255):
Displayed 40 items.
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- Lower bounds for agnostic learning via approximate rank (Q626689) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Boosting and hard-core set construction (Q1394786) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (Q2819595) (← links)
- Bounding the average sensitivity and noise sensitivity of polynomial threshold functions (Q2875180) (← links)
- An invariance principle for polytopes (Q2875181) (← links)
- (Q2880992) (← links)
- (Q2969663) (← links)
- (Q3002772) (← links)
- (Q3093360) (← links)
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (Q3149879) (← links)
- An Explicit VC-Theorem for Low-Degree Polynomials (Q3167420) (← links)
- (Q3191612) (← links)
- Agnostically Learning Halfspaces (Q3549323) (← links)
- (Q3549710) (← links)
- Learnability beyond AC <sup>0</sup> (Q3579219) (← links)
- Learning Halfspaces with Malicious Noise (Q3638067) (← links)
- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions (Q3638906) (← links)
- Learning Theory (Q4680879) (← links)
- Learning Theory (Q4680888) (← links)
- Learning Theory (Q4680913) (← links)
- (Q4780799) (← links)
- (Q5009539) (← links)
- Randomness efficient identity testing of multivariate polynomials (Q5175971) (← links)
- Learning DNF in time (Q5175978) (← links)
- (Q5302076) (← links)
- Learning Theory and Kernel Machines (Q5305870) (← links)
- Improved Lower Bounds for Learning Intersections of Halfspaces (Q5307578) (← links)
- Efficient Learning Algorithms Yield Circuit Lower Bounds (Q5307579) (← links)
- An invariance principle for polytopes (Q5395697) (← links)
- A Lower Bound for Agnostically Learning Disjunctions (Q5434065) (← links)
- Linear Advice for Randomized Logarithmic Space (Q5449822) (← links)
- An FPTAS for #Knapsack and Related Counting Problems (Q5495001) (← links)
- (Q5743502) (← links)