{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:52Z","timestamp":1770994072875,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T00:00:00Z","timestamp":1326153600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10878-011-9445-8","type":"journal-article","created":{"date-parts":[[2012,1,9]],"date-time":"2012-01-09T15:02:27Z","timestamp":1326121347000},"page":"636-654","source":"Crossref","is-referenced-by-count":2,"title":["Property testing for cyclic groups and beyond"],"prefix":"10.1007","volume":"26","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","published-online":{"date-parts":[[2012,1,10]]},"reference":[{"key":"9445_CR1","first-page":"164","volume-title":"Proc of STOC 1991","author":"L Babai","year":"1991","unstructured":"Babai L (1991) Local expansion of vertex-transitive graphs and random generation in finite groups. In: Proc of STOC 1991, pp 164\u2013174"},{"key":"9445_CR2","first-page":"229","volume-title":"Proc of FOCS 1984","author":"L Babai","year":"1984","unstructured":"Babai L, Szemer\u00e9di E (1984) On the complexity of matrix group problems I. In: Proc of FOCS 1984, pp 229\u2013240"},{"key":"9445_CR3","volume-title":"Algorithmic number theory, volume 1: efficient algorithms","author":"E Bach","year":"1996","unstructured":"Bach E, Shallit J (1996) Algorithmic number theory, volume 1: efficient algorithms. The MIT Press, Cambridge"},{"key":"9445_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/rsa.20182","volume":"32","author":"M Ben-Or","year":"2008","unstructured":"Ben-Or M, Coppersmith D, Luby M, Rubinfeld R (2008) Non-abelian homomorphism testing, and distributions close to their self-convolutions. Random Struct Algorithms 32:49\u201370","journal-title":"Random Struct Algorithms"},{"issue":"3","key":"9445_CR5","doi-asserted-by":"crossref","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 (1993) Self-testing\/correcting with applications to numerical problems. J\u00a0Comput Syst Sci 47(3):549\u2013595","journal-title":"J\u00a0Comput Syst Sci"},{"issue":"3","key":"9445_CR6","first-page":"26","volume":"1","author":"K Cheung","year":"2001","unstructured":"Cheung K, Mosca M (2001) Decomposing finite abelian groups. Quantum Inf Comput 1(3):26\u201332","journal-title":"Quantum Inf Comput"},{"issue":"2","key":"9445_CR7","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ic.2004.04.001","volume":"192","author":"R Cleve","year":"2004","unstructured":"Cleve R (2004) The query complexity of order-finding. Inf Comput 192(2):162\u2013171","journal-title":"Inf Comput"},{"key":"9445_CR8","first-page":"23","volume":"89","author":"A Czumaj","year":"2006","unstructured":"Czumaj A, Sohler C (2006) Survey on sublinear-time algorithms. Bull Eur Assoc Theor Comput Sci 89:23\u201347","journal-title":"Bull Eur Assoc Theor Comput Sci"},{"issue":"3","key":"9445_CR9","doi-asserted-by":"crossref","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 (2000) Spot-checkers. J Comput Syst Sci 60(3):717\u2013751","journal-title":"J Comput Syst Sci"},{"key":"9445_CR10","first-page":"157","volume-title":"Proc of STOC 2005","author":"K Friedl","year":"2005","unstructured":"Friedl K, Ivanyos G, Santha M (2005) Efficient testing of groups. In: Proc of STOC 2005, pp 157\u2013166"},{"issue":"1","key":"9445_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00453-009-9338-8","volume":"59","author":"Y Inui","year":"2011","unstructured":"Inui Y, Le Gall F (2011) Quantum property testing of group solvability. Algorithmica 59(1):35\u201347","journal-title":"Algorithmica"},{"key":"9445_CR12","unstructured":"Ivanyos G (2007) Classical and quantum algorithms for algebraic problems. Thesis for the degree \u201cDoctor of the Hungarian Academy of Sciences\u201d"},{"key":"9445_CR13","unstructured":"Ivanyos G (2010) Personal communication"},{"key":"9445_CR14","unstructured":"Ivanyos G, Le Gall F, Yoshida Y (2011) On the distance between non-isomorphic groups. Eur J Comb (accepted for publication). Preprint available at http:\/\/arxiv.org\/abs\/1107.0133"},{"key":"9445_CR15","series-title":"LNCS","first-page":"30","volume-title":"Proc of STACS 2002","author":"MA Kiwi","year":"2002","unstructured":"Kiwi MA, Magniez F, Santha M (2002) Exact and approximate testing\/correcting of algebraic functions: A survey. In: Proc of STACS 2002. LNCS, vol 2292, pp 30\u201383"},{"issue":"4","key":"9445_CR16","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/S0097539797325387","volume":"29","author":"S Rajagopalan","year":"2000","unstructured":"Rajagopalan S, Schulman LJ (2000) Verification of identities. SIAM J Comput 29(4):1155\u20131163","journal-title":"SIAM J Comput"},{"key":"9445_CR17","doi-asserted-by":"crossref","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 (2001) Property testing. In: Handbook of randomized computing. Kluwer Academic, Dordrecht, pp 597\u2013649"},{"issue":"4","key":"9445_CR18","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1137\/S009753970444658X","volume":"36","author":"A Shpilka","year":"2006","unstructured":"Shpilka A, Wigderson A (2006) Derandomizing homomorphism testing in general groups. SIAM J Comput 36(4):1215\u20131230","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9445-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9445-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9445-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:16Z","timestamp":1559262196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9445-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,10]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9445"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9445-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,10]]}}}