{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T03:40:10Z","timestamp":1743824410968,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_42","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"495-504","source":"Crossref","is-referenced-by-count":2,"title":["An Explicit VC-Theorem for Low-Degree Polynomials"],"prefix":"10.1007","author":[{"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Klivans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pravesh","family":"Kothari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Klivans, A., Kothari, P.: An explicit vc-theorem for low degree polynomials. Full Version (2012)","DOI":"10.1007\/978-3-642-32512-0_42"},{"key":"42_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626371","volume-title":"The discrepancy method: randomness and complexity","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The discrepancy method: randomness and complexity. Cambridge University Press, New York (2000)"},{"issue":"3","key":"42_CR3","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B. Chazelle","year":"1996","unstructured":"Chazelle, B., Matousek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms\u00a021(3), 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: STOC, pp. 569\u2013578 (2011)","DOI":"10.1145\/1993636.1993712"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP unless E has sub-exponential circuits: Derandomizing the XOR lemma (preliminary version). In: Proceedings of the 29th STOC, pp. 220\u2013229. ACM Press (1996)","DOI":"10.1145\/258533.258590"},{"key":"42_CR6","first-page":"2001","volume":"62","author":"Y. Li","year":"2000","unstructured":"Li, Y., Long, P.M., Srinivasan, A.: Improved bounds on the sample complexity of learning. Journal of Computer and System Sciences\u00a062, 2001 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Matousek, J.: Geometric Discrepancy: An Illustrated Guide (Algorithms and Combinatorics), 1st edn. Springer (1999)","DOI":"10.1007\/978-3-642-03942-3_1"},{"issue":"4","key":"42_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"N. Nisan","year":"1992","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica\u00a012(4), 449\u2013461 (1992)","journal-title":"Combinatorica"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Nisan, N.: RL \u2286 SC. In: STOC, pp. 619\u2013623 (1992)","DOI":"10.1145\/129712.129772"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Servedio, R.A.: New degree bounds for polynomial threshold functions. In: STOC, pp. 325\u2013334 (2003)","DOI":"10.1145\/780542.780592"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Pach, J., Agrawal, P.: Combinatorial Geometry. Wiley-Interscience (October 1995)","DOI":"10.1002\/9781118033203"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Sivakumar, D.: Algorithmic derandomization via complexity theory. In: IEEE Conference on Computational Complexity, p. 10 (2002)","DOI":"10.1145\/509994.509996"},{"issue":"2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications\u00a016(2), 264\u2013280 (1971)","journal-title":"Theory of Probability and its Applications"},{"key":"42_CR14","unstructured":"Vapnik, V.N.: Statistical learning theory. Wiley (1998)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T03:24:57Z","timestamp":1743823497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}