{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:04:26Z","timestamp":1648731866370},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,23]],"date-time":"2012-11-23T00:00:00Z","timestamp":1353628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s00037-012-0051-7","type":"journal-article","created":{"date-parts":[[2012,11,22]],"date-time":"2012-11-22T17:09:25Z","timestamp":1353604165000},"page":"679-725","source":"Crossref","is-referenced-by-count":2,"title":["Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields"],"prefix":"10.1007","volume":"22","author":[{"given":"Shachar","family":"Lovett","sequence":"first","affiliation":[]},{"given":"Partha","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"Amir","family":"Shpilka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,23]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Ajtai (1983). $${\\sum_{1}^{1}}$$ formulae on finite structures. Annals of Pure and Applied Logic 24, 1\u201348.","DOI":"10.1016\/0168-0072(83)90038-6"},{"issue":"3","key":"51_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"Alon Noga","year":"1992","unstructured":"Noga Alon, Oded Goldreich, Johan H\u00e5stad & Ren\u00e9 Peralta (1992) Simple Construction of Almost k-wise Independent Random Variables. Random Structures and Algorithms 3(3): 289\u2013304","journal-title":"Random Structures and Algorithms"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Sanjeev Arora & Boaz Barak (2009). Computational complexity: a modern approach. Cambridge University Press","DOI":"10.1017\/CBO9780511804090"},{"issue":"6","key":"51_CR4","doi-asserted-by":"crossref","first-page":"2220","DOI":"10.1137\/070691954","volume":"38","author":"Bazzi Louay M. J.","year":"2009","unstructured":"Louay M. J. Bazzi (2009) Polylogarithmic Independence Can Fool DNF Formulas. SIAM J. Comput. 38(6): 2220\u20132272","journal-title":"SIAM J. Comput."},{"issue":"6","key":"51_CR5","doi-asserted-by":"crossref","first-page":"2464","DOI":"10.1137\/070712109","volume":"39","author":"Bogdanov. Andrej","year":"2010","unstructured":"Andrej Bogdanov., Emanuele Viola (2010) Pseudorandom Bits for Polynomials. SIAM J. Comput. 39(6): 2464\u20132486","journal-title":"SIAM J. Comput."},{"key":"51_CR6","unstructured":"Mark Braverman (2010). Polylogarithmic independence fools AC0 circuits. J. ACM 57(5)."},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Oded Goldreich (2008). Computational Complexity: A Conceptual Perspective. Cambridge University Press.","DOI":"10.1017\/CBO9780511804106"},{"key":"51_CR8","unstructured":"Johan H\u00e5stad (1986). Computational limitations for small-depth circuits. Ph.D. thesis, MIT."},{"key":"51_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02128670","volume":"10","author":"Linial. Nati","year":"1990","unstructured":"Nati Linial., Noam Nisan (1990) Approximate inclusion-exclusion. Combinatorica 10: 349\u2013365","journal-title":"Combinatorica"},{"issue":"1","key":"51_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.4086\/toc.2009.v005a003","volume":"5","author":"Lovett Shachar","year":"2009","unstructured":"Shachar Lovett (2009) Unconditional Pseudorandom Generators for Low Degree Polynomials. Theory of Computing 5(1): 69\u201382","journal-title":"Theory of Computing"},{"key":"51_CR11","first-page":"695","volume":"10","author":"Lovett Shachar","year":"2010","unstructured":"Shachar Lovett, Partha Mukhopadhyay., Amir Shpilka (2010) Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. In FOCS\u2019 10: 695\u2013704","journal-title":"In FOCS\u2019"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Shachar Lovett, Omer Reingold, Luca Trevisan & Salil Vadhan (2009). Pseudorandom Bit Generators That Fool Modular Sums. In Proceedings of the 13th RANDOM, 615\u2013630. ISBN 978-3-642-03684-2.","DOI":"10.1007\/978-3-642-03685-9_46"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Michael Luby, Boban Velickovic & Avi Wigderson (1993). Deterministic approximate counting of depth-2 circuits. In Proceedings of the 2nd ISTCS, 18\u201324.","DOI":"10.1109\/ISTCS.1993.253488"},{"key":"51_CR14","unstructured":"Raghu Meka & David Zuckerman (2009). Small-Bias Spaces for Group Products. In Proceedings of the 13th RANDOM, 658\u2013672."},{"issue":"4","key":"51_CR15","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"Naor. Joseph","year":"1993","unstructured":"Joseph Naor., Moni Naor (1993) Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. on Computing 22(4): 838\u2013856","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"51_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01375474","volume":"11","author":"Nisan Noam","year":"1991","unstructured":"Noam Nisan (1991) Pseudorandom bits for constant depth circuits. Combinatorica 11(1): 63\u201370","journal-title":"Combinatorica"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Noam Nisan & Avi Wigderson (1994). Hardness vs. randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167. ISSN 0022-0000.","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"51_CR18","doi-asserted-by":"crossref","unstructured":"Alexander A. Razborov (1987). Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Math. Notes 41(4), 333\u2013338.","DOI":"10.1007\/BF01137685"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"Roman Smolensky (1987). Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the 19th STOC, 77\u201382. ISBN 0-89791-221-7.","DOI":"10.1145\/28395.28404"},{"issue":"2","key":"51_CR20","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s00037-009-0273-5","volume":"18","author":"Viola Emanuele","year":"2009","unstructured":"Emanuele Viola (2009) The Sum of d Small-Bias Generators Fools Polynomials of Degree d. Computational Complexity 18(2): 209\u2013217","journal-title":"Computational Complexity"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Ryan Williams (2011). Non-uniform ACC Circuit Lower Bounds. In IEEE Conference on Computational Complexity, 115\u2013125. IEEE Com puter Society.","DOI":"10.1109\/CCC.2011.36"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0051-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-012-0051-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0051-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T23:29:02Z","timestamp":1562369342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-012-0051-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,23]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s00037-012-0051-7","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,23]]}}}