{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:53:57Z","timestamp":1774335237169,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642403279","type":"print"},{"value":"9783642403286","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_31","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:17:34Z","timestamp":1376644654000},"page":"436-451","source":"Crossref","is-referenced-by-count":14,"title":["Small-Bias Sets for Nonabelian Groups"],"prefix":"10.1007","author":[{"given":"Sixia","family":"Chen","sequence":"first","affiliation":[]},{"given":"Cristopher","family":"Moore","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/rsa.3240050203","volume":"5","author":"N. Alon","year":"1994","unstructured":"Alon, N., Roichman, Y.: Random Cayley graphs and expanders. Random Structures and Algorithms\u00a05(2), 271\u2013284 (1994)","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory\u00a038(2), 509\u2013516 (1992)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Struct. Algorithms\u00a03(3), 289\u2013304 (1992)","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"31_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.4086\/toc.2013.v009a005","volume":"9","author":"A. Ben-Aroya","year":"2013","unstructured":"Ben-Aroya, A., Ta-Shma, A.: Constructing small-bias sets from algebraic-geometric codes. Theory of Computing\u00a09(5), 253\u2013272 (2013)","journal-title":"Theory of Computing"},{"issue":"6","key":"31_CR5","doi-asserted-by":"publisher","first-page":"2464","DOI":"10.1137\/070712109","volume":"39","author":"A. Bogdanov","year":"2010","unstructured":"Bogdanov, A., Viola, E.: Pseudorandom bits for polynomials. SIAM Journal on Computing\u00a039(6), 2464\u20132486 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"De, A.: Pseudorandomness for permutation and regular branching programs. In: 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), pp. 221\u2013231 (2011)","DOI":"10.1109\/CCC.2011.23"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 1\u20139 (2003)","DOI":"10.1145\/780543.780544"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/0021-8693(89)90204-4","volume":"120","author":"S.P. Glasby","year":"1989","unstructured":"Glasby, S.P.: The composition and derived lengths of a soluble group. J. Algebra\u00a0120, 406\u2013413 (1989)","journal-title":"J. Algebra"},{"issue":"3","key":"31_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/978-3-642-03685-9_49","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"R. Meka","year":"2009","unstructured":"Meka, R., Zuckerman, D.: Small-bias spaces for group products. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 658\u2013672. Springer, Heidelberg (2009)"},{"issue":"4","key":"31_CR11","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1145\/1198513.1198525","volume":"2","author":"C. Moore","year":"2006","unstructured":"Moore, C., Rockmore, D., Russell, A.: Generic quantum fourier transforms. ACM Transactions on Algorithms\u00a02(4), 707\u2013723 (2006)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M. Morgenstern","year":"1994","unstructured":"Morgenstern, M.: Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q. Journal of Combinatorial Theory, Series B\u00a062(1), 44\u201362 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J.B. Rosser","year":"1962","unstructured":"Rosser, J.B., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics\u00a06, 64\u201394 (1962)","journal-title":"Illinois Journal of Mathematics"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/11538462_37","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"E. Rozenman","year":"2005","unstructured":"Rozenman, E., Vadhan, S.: Derandomized squaring of graphs. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX and RANDOM 2005. LNCS, vol.\u00a03624, pp. 436\u2013447. Springer, Heidelberg (2005)"},{"issue":"3","key":"31_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.4086\/toc.2008.v004a003","volume":"4","author":"A. Wigderson","year":"2008","unstructured":"Wigderson, A., Xiao, D.: Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications. Theory of Computing\u00a04(3), 53\u201376 (2008)","journal-title":"Theory of Computing"}],"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-40328-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:18:25Z","timestamp":1558016305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}