An explicit VC-theorem for low-degree polynomials

DOI10.1007/978-3-642-32512-0_42MaRDI QIDQ3167420zbMATH OpenOpenAlexFDO

Authors Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari

Publication date 2 November 2012

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32512-0_42

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Recommendations

• On the complexity of approximating the VC dimension.
• On Improved Degree Lower Bounds for Polynomial Approximation.
• VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
• Hardness amplification and the approximate degree of constant-depth circuits
• Algorithmic polynomials

Cited in

(2)

• Verification of a low-degree polynomial vanishing at empirical points
• On the complexity of approximating the VC dimension.

This page was built for publication: An explicit VC-theorem for low-degree polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167420)