{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:57Z","timestamp":1759639077048,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196466"},{"type":"electronic","value":"9783319196473"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19647-3_12","type":"book-chapter","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T09:03:08Z","timestamp":1435309388000},"page":"125-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Solving Systems of Diagonal Polynomial Equations Over Finite Fields"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Ivanyos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,27]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bacon, D., Childs, A.M., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 469\u2013478 (2005)","DOI":"10.1109\/SFCS.2005.38"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02940714","volume":"11","author":"C Chevalley","year":"1936","unstructured":"Chevalley, C.: D\u00e9monstration d\u2019une hypoth\u00e8se de M. Artin. Abh. Math. Sem. Hamburg 11, 73\u201375 (1936)","journal-title":"Abh. Math. Sem. Hamburg"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Childs, A.M., Schulman, L., Vazirani, U.: Quantum algorithms for hidden nonlinear structures. In: 48th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 395\u2013404 (2007)","DOI":"10.1109\/FOCS.2007.18"},{"key":"12_CR5","first-page":"0215","volume":"9","author":"T Decker","year":"2009","unstructured":"Decker, T., Draisma, J., Wocjan, P.: Quantum algorithm for identifying hidden polynomial function graphs. Quantum Inf. Comput. 9, 0215\u20130230 (2009)","journal-title":"Quantum Inf. Comput."},{"key":"12_CR6","first-page":"790","volume":"14","author":"T Decker","year":"2014","unstructured":"Decker, T., H\u00f8yer, P., Ivanyos, G., Santha, M.: Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Inf. Comput. 14, 790\u2013806 (2014)","journal-title":"Quantum Inf. Comput."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/120864416","volume":"42","author":"T Decker","year":"2013","unstructured":"Decker, T., Ivanyos, G., Santha, M., Wocjan, P.: Hidden symmetry subgroup problems. SIAM J. Comput. 42, 1987\u20132007 (2013)","journal-title":"SIAM J. Comput."},{"key":"12_CR8","first-page":"282","volume":"10","author":"A Denney","year":"2010","unstructured":"Denney, A., Moore, C., Russell, A.: Finding conjugate stabilizer subgroups in $$PSL(2; q)$$ and related groups. Quantum Inf. Comput. 10, 282\u2013291 (2010)","journal-title":"Quantum Inf. Comput."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/130907203","volume":"43","author":"K Friedl","year":"2014","unstructured":"Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and translating coset in quantum computing. SIAM J. Comput. 43, 1\u201324 (2014)","journal-title":"SIAM J. Comput."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Grigni, M., Schulman, L., Vazirani M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In: 33rd ACM Symposium on Theory of Computing (STOC), pp. 68\u201374 (2001)","DOI":"10.1145\/380752.380769"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1137\/S009753970139450X","volume":"32","author":"S Hallgren","year":"2003","unstructured":"Hallgren, S., Russell, A., Ta-Shma, A.: Normal subgroup reconstruction and quantum computation using group representations. SIAM J. Comput. 32, 916\u2013934 (2003)","journal-title":"SIAM J. Comput."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Huang, M-D.A: Riemann hypothesis and finding roots over finite fields. In: 17th Annual ACM Symposium on Theory of Computing (STOC), pp. 121\u2013130 (1985)","DOI":"10.1145\/22145.22159"},{"key":"12_CR13","unstructured":"Ivanyos, G., Santha, M.: On solving systems of diagonal polynomial equations over finite fields. arXiv:1503.09016 [cs.CC]"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s00453-010-9467-0","volume":"62","author":"G Ivanyos","year":"2012","unstructured":"Ivanyos, G., Sanselme, L., Santha, M.: An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Algoritmica 62, 480\u2013498 (2012)","journal-title":"Algoritmica"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/5992.909000","volume":"3","author":"R Jozsa","year":"2001","unstructured":"Jozsa, R.: Quantum factoring, discrete logarithms, and the hidden subgroup problem. Comput. Sci. Engin. 3, 34\u201343 (2001)","journal-title":"Comput. Sci. Engin."},{"key":"12_CR16","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, New York (1972)"},{"key":"12_CR17","unstructured":"Kitaev, A.Y.: Quantum measurements and the Abelian Stabilizer Problem (1995). arXiv:quant-ph\/9511026v1"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35, 170\u2013188 (2005)","journal-title":"SIAM J. Comput."},{"key":"12_CR19","unstructured":"Moore, C., Rockmore, D., Russell, A., Schulman, L.: The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1113\u20131122 (2004)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48, 498\u2013532 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O Regev","year":"2004","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM J. Comput. 33, 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"12_CR22","unstructured":"Shanks., D.: Five number-theoretic algorithms. In: 2nd Manitoba Conference on Numerical Mathematics, pp. 51\u201370 (1972)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithm and factoring. SIAM J. Comput. 26, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"12_CR24","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company, Boston (1997)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"van de Woestijne, C.E.: Deterministic equation solving over finite fields. Ph.D. thesis, Universiteit Leiden (2006)","DOI":"10.1145\/1073884.1073932"},{"key":"12_CR26","first-page":"76","volume":"11","author":"E Warning","year":"1936","unstructured":"Warning, E.: Bemerkung zur vorstehenden Arbeit von Herrn Chevalley. Abh. Math. Sem. Hamburg 11, 76\u201383 (1936)","journal-title":"Abh. Math. Sem. Hamburg"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19647-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T21:48:26Z","timestamp":1748468906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19647-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196466","9783319196473"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19647-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}