{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:39Z","timestamp":1725600459349},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_38","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"432-443","source":"Crossref","is-referenced-by-count":0,"title":["Property Testing for Cyclic Groups and Beyond"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Le Gall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups. In: Proc. of STOC 1991, pp. 164\u2013174 (1991)","DOI":"10.1145\/103418.103440"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., Szemer\u00e9di, E.: On the complexity of matrix group problems I. In: Proc. of FOCS 1984, pp. 229\u2013240 (1984)","DOI":"10.1109\/SFCS.1984.715919"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-27821-4_25","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Ben Or","year":"2004","unstructured":"Ben Or, M., Coppersmith, D., Luby, M., Rubinfeld, R.: Non-abelian homomorphism testing, and distributions close to their self-convolutions. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 273\u2013285. Springer, Heidelberg (2004)"},{"issue":"3","key":"38_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci.\u00a047(3), 549\u2013595 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"38_CR5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.26421\/QIC1.3-2","volume":"1","author":"K. Cheung","year":"2001","unstructured":"Cheung, K., Mosca, M.: Decomposing finite abelian groups. Quantum Information and Computation\u00a01(3), 26\u201332 (2001)","journal-title":"Quantum Information and Computation"},{"issue":"2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ic.2004.04.001","volume":"192","author":"R. Cleve","year":"2004","unstructured":"Cleve, R.: The query complexity of order-finding. Inf. Comput.\u00a0192(2), 162\u2013171 (2004)","journal-title":"Inf. Comput."},{"key":"38_CR7","first-page":"23","volume":"89","author":"A. Czumaj","year":"2006","unstructured":"Czumaj, A., Sohler, C.: Survey on sublinear-time algorithms. Bulletin of the EATCS\u00a089, 23\u201347 (2006)","journal-title":"Bulletin of the EATCS"},{"issue":"3","key":"38_CR8","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1006\/jcss.1999.1692","volume":"60","author":"F. Erg\u00fcn","year":"2000","unstructured":"Erg\u00fcn, F., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. J. Comput. Syst. Sci.\u00a060(3), 717\u2013751 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Friedl, K., Ivanyos, G., Santha, M.: Efficient testing of groups. In: Proc. of STOC 2005, pp. 157\u2013166 (2005)","DOI":"10.1145\/1060590.1060614"},{"issue":"1","key":"38_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00453-009-9338-8","volume":"59","author":"Y. Inui","year":"2011","unstructured":"Inui, Y., Le Gall, F.: Quantum property testing of group solvability. Algorithmica\u00a059(1), 35\u201347 (2011)","journal-title":"Algorithmica"},{"key":"38_CR11","unstructured":"Ivanyos, G.: Classical and quantum algorithms for algebraic problems. Thesis for the degree \u201cDoctor of the Hungarian Academy of Sciences\u201d (2007)"},{"key":"38_CR12","unstructured":"Ivanyos, G.: Personal Communication (2010)"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-45878-6_2","volume-title":"Theoretical Aspects of Computer Science","author":"M.A. Kiwi","year":"2002","unstructured":"Kiwi, M.A., Magniez, F., Santha, M.: Exact and approximate testing\/correcting of algebraic functions: A survey. In: Khosrovshahi, G.B., Shokoufandeh, A., Shokrollahi, M.A. (eds.) Theoretical Aspects of Computer Science 2000. LNCS, vol.\u00a02292, pp. 30\u201383. Springer, Heidelberg (2002)"},{"key":"38_CR14","unstructured":"Le Gall, F., Yoshida, Y.: Property testing for cyclic groups and beyond, Full version of the present paper available at http:\/\/arxiv.org\/abs\/1105.1842"},{"issue":"4","key":"38_CR15","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/S0097539797325387","volume":"29","author":"S. Rajagopalan","year":"2000","unstructured":"Rajagopalan, S., Schulman, L.J.: Verification of identities. SIAM J. Comput.\u00a029(4), 1155\u20131163 (2000)","journal-title":"SIAM J. Comput."},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-1-4615-0013-1_15","volume-title":"Handbook of Randomized Computing","author":"D. Ron","year":"2001","unstructured":"Ron, D.: Property testing. In: Handbook of Randomized Computing, pp. 597\u2013649. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"4","key":"38_CR17","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1137\/S009753970444658X","volume":"36","author":"A. Shpilka","year":"2006","unstructured":"Shpilka, A., Wigderson, A.: Derandomizing homomorphism testing in general groups. SIAM J. Comput.\u00a036(4), 1215\u20131230 (2006)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T03:48:56Z","timestamp":1638244136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}