{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:06:47Z","timestamp":1760170007788,"version":"3.30.2"},"reference-count":22,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3917,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0022-0000(02)00022-3","type":"journal-article","created":{"date-parts":[[2002,12,27]],"date-time":"2002-12-27T13:04:53Z","timestamp":1040994293000},"page":"660-671","source":"Crossref","is-referenced-by-count":20,"title":["On the complexity of approximating the VC dimension"],"prefix":"10.1016","volume":"65","author":[{"given":"Elchanan","family":"Mossel","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Umans","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(02)00022-3_BIB1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(83)90253-4","article-title":"On the density of sets of vectors","volume":"46","author":"Alon","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0022-0000(02)00022-3_BIB2","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","article-title":"Arthur\u2013Merlin games","volume":"36","author":"Babai","year":"1988","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0022-0000(02)00022-3_BIB3","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","article-title":"Privacy amplification by public discussion","volume":"17","author":"Bennett","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(02)00022-3_BIB4","doi-asserted-by":"crossref","unstructured":"B. Chor, J. Friedman, O. Goldreich, J. Hastad, S. Rudich, R. Smolensky, The bit extraction problem or t-resilient functions, in: Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS 85), Portland, OR, 1985, pp. 396\u2013407.","DOI":"10.1109\/SFCS.1985.55"},{"key":"10.1016\/S0022-0000(02)00022-3_BIB5","doi-asserted-by":"crossref","unstructured":"V. Guruswami, P. Indyk, Expander-based constructions of efficiently decodable codes, in: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, 2001, pp. 658\u2013667.","DOI":"10.1109\/SFCS.2001.959942"},{"key":"10.1016\/S0022-0000(02)00022-3_BIB6","doi-asserted-by":"crossref","unstructured":"V. Guruswami, M. Sudan, List decoding algorithms for certain concatenated codes, in: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), Portland, OR, 2000.","DOI":"10.1145\/335305.335327"},{"key":"10.1016\/S0022-0000(02)00022-3_BIB7","doi-asserted-by":"crossref","unstructured":"J. Kahn, G. Kalai, N. Linial, The influence of variables on Boolean functions, in: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), White Plains, NY, 1988, pp. 68\u201380.","DOI":"10.1109\/SFCS.1988.21923"},{"key":"10.1016\/S0022-0000(02)00022-3_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(78)90197-8","article-title":"Coordinate density of sets of vectors","volume":"24","author":"Karpovsky","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0022-0000(02)00022-3_BIB9","unstructured":"K.-I. Ko, C.-L. Lin, Non-approximability in the polynomial-time hierarchy, Technical Report TR-94-2, Department of Computer Science, State University of New York at Stony Brook, 1994."},{"key":"10.1016\/S0022-0000(02)00022-3_BIB10","series-title":"Minimax and Applications","first-page":"219","article-title":"On the complexity of min-max optimization problems and their approximation","author":"Ko","year":"1995"},{"key":"10.1016\/S0022-0000(02)00022-3_BIB11","doi-asserted-by":"crossref","unstructured":"N. Linial, Y. Mansour, R.L. Rivest, Results on learnability and the Vapnik\u2013\u010cervonenkis dimension, in: Proceedings of FOCS, White Plains, NY, 1988, pp. 120\u2013129.","DOI":"10.1109\/SFCS.1988.21930"},{"issue":"1","key":"10.1016\/S0022-0000(02)00022-3_BIB12","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1006\/jcss.1997.1546","article-title":"Extracting randomness","volume":"58","author":"Nisan","year":"1999","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0022-0000(02)00022-3_BIB13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/jcss.1996.0058","article-title":"On limited nondeterminism and the complexity of the V\u2013C dimension","volume":"53","author":"Papadimitriou","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(02)00022-3_BIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","article-title":"On the density of families of sets","volume":"13","author":"Sauer","year":"1972","journal-title":"J. Combin. Theory, A"},{"issue":"1","key":"10.1016\/S0022-0000(02)00022-3_BIB15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jcss.1998.1602","article-title":"Deciding the Vapnik\u2013\u010cervonenkis dimension is \u03a33p-complete","volume":"58","author":"Schaefer","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(02)00022-3_BIB16","doi-asserted-by":"crossref","unstructured":"R. Shaltiel, C. Umans, Simple extractors for all min-entropies and a new pseudo-random generator, in: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, 2001, pp. 648\u2013657.","DOI":"10.1109\/SFCS.2001.959941"},{"key":"10.1016\/S0022-0000(02)00022-3_BIB17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","article-title":"A combinatorial problem","volume":"41","author":"Shelah","year":"1972","journal-title":"Pacific J. Math."},{"issue":"3","key":"10.1016\/S0022-0000(02)00022-3_BIB18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0022-0000(88)90035-9","article-title":"Expanders, randomness, or time versus space","volume":"36","author":"Sipser","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(02)00022-3_BIB19","doi-asserted-by":"crossref","unstructured":"A. Ta-Shma, C. Umans, and D. Zuckerman, Loss-less condensers, unbalanced expanders, and extractors, in: Proceedings of the 33rd ACM Symposium on Theory of computing (STOC), Hersonissos, Crete, Greece, 2001, pp. 143\u2013152.","DOI":"10.1145\/380752.380790"},{"key":"10.1016\/S0022-0000(02)00022-3_BIB20","doi-asserted-by":"crossref","unstructured":"A. Ta-Shma, D. Zuckerman, S. Safra, Extractors from Reed\u2013Muller codes, in: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, 2001, pp. 638\u2013647.","DOI":"10.1109\/SFCS.2001.959940"},{"key":"10.1016\/S0022-0000(02)00022-3_BIB21","unstructured":"C. Umans, Hardness of approximating \u03a32p minimization problems, in: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 99), New York, NY, 1999, pp. 465\u2013474."},{"issue":"4","key":"10.1016\/S0022-0000(02)00022-3_BIB22","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579325","article-title":"Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources","volume":"7","author":"Vazirani","year":"1987","journal-title":"Combinatorica"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T19:20:38Z","timestamp":1583954438000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0022000002000223"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00022-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}