乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:06:54Z","timestamp":1740114414310,"version":"3.37.3"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","award":["MOE2012-T3-1-009"],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","award":["NK105645"],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["600700","ANR-12-BS02-005"],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1016\/j.tcs.2016.04.045","type":"journal-article","created":{"date-parts":[[2016,6,7]],"date-time":"2016-06-07T17:14:27Z","timestamp":1465319667000},"page":"73-85","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"PA","title":["Solving systems of diagonal polynomial equations over finite fields"],"prefix":"10.1016","volume":"657","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3826-1735","authenticated-orcid":false,"given":"G\u00e1bor","family":"Ivanyos","sequence":"first","affiliation":[]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2016.04.045_br0010","series-title":"Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"175","article-title":"On taking roots in finite fields","author":"Adleman","year":"1977"},{"key":"10.1016\/j.tcs.2016.04.045_br0020","series-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC)","first-page":"99","article-title":"Generating hard instances of lattice problems","author":"Ajtai","year":"1966"},{"key":"10.1016\/j.tcs.2016.04.045_br0030","series-title":"Proceedings of the 2002 International Congress of Mathematicians (ICM), vol. I","first-page":"119","article-title":"Discrete mathematics: methods and challenges","author":"Alon","year":"2002"},{"key":"10.1016\/j.tcs.2016.04.045_br0040","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","article-title":"Explicit bounds for primality testing and related problems","volume":"55","author":"Bach","year":"1990","journal-title":"Math. Comp."},{"key":"10.1016\/j.tcs.2016.04.045_br0050","series-title":"Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"469","article-title":"From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups","author":"Bacon","year":"2005"},{"key":"10.1016\/j.tcs.2016.04.045_br0060","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02940714","article-title":"D\u00e9monstration d'une hypoth\u00e8se de M. Artin","volume":"11","author":"Chevalley","year":"1936","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"key":"10.1016\/j.tcs.2016.04.045_br0070","series-title":"Proceedings of the 48th IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"395","article-title":"Quantum algorithms for hidden nonlinear structures","author":"Childs","year":"2007"},{"key":"10.1016\/j.tcs.2016.04.045_br0080","first-page":"0215","article-title":"Quantum algorithm for identifying hidden polynomial function graphs","volume":"9","author":"Decker","year":"2009","journal-title":"Quantum Inf. Comput."},{"key":"10.1016\/j.tcs.2016.04.045_br0090","first-page":"790","article-title":"Polynomial time quantum algorithms for certain bivariate hidden polynomial problems","volume":"14","author":"Decker","year":"2014","journal-title":"Quantum Inf. Comput."},{"key":"10.1016\/j.tcs.2016.04.045_br0100","doi-asserted-by":"crossref","first-page":"1987","DOI":"10.1137\/120864416","article-title":"Hidden symmetry subgroup problems","volume":"42","author":"Decker","year":"2013","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2016.04.045_br0110","first-page":"282","article-title":"Finding conjugate stabilizer subgroups in PSL(2;q) and related groups","volume":"10","author":"Denney","year":"2010","journal-title":"Quantum Inf. Comput."},{"key":"10.1016\/j.tcs.2016.04.045_br0120","series-title":"Proceedings of the 35th ACM Symposium on Theory of Computing (STOC)","first-page":"1","article-title":"Hidden translation and orbit coset in quantum computing","author":"Friedl","year":"2013"},{"key":"10.1016\/j.tcs.2016.04.045_br0130","series-title":"Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC)","first-page":"68","article-title":"Quantum mechanical algorithms for the nonabelian hidden subgroup problem","author":"Grigni","year":"2001"},{"key":"10.1016\/j.tcs.2016.04.045_br0140","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1137\/S009753970139450X","article-title":"Normal subgroup reconstruction and quantum computation using group representations","volume":"32","author":"Hallgren","year":"2003","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2016.04.045_br0160","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/s00453-010-9467-0","article-title":"An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups","volume":"62","author":"Ivanyos","year":"2012","journal-title":"Algoritmica"},{"key":"10.1016\/j.tcs.2016.04.045_br0170","series-title":"Proceedings of 9th International Workshop on Frontiers in Algorithms (FAW 2015)","first-page":"125","article-title":"On solving systems of diagonal polynomial equations over finite fields","volume":"vol. 9130","author":"Ivanyos","year":"2015"},{"key":"10.1016\/j.tcs.2016.04.045_br0180","first-page":"263","article-title":"De usu legitimo formulae summatoriae Maclaurinianae","volume":"12","author":"Jacobi","year":"1834","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/j.tcs.2016.04.045_br0190","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"author":"Kitaev","key":"10.1016\/j.tcs.2016.04.045_br0200"},{"key":"10.1016\/j.tcs.2016.04.045_br0210","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/S0097539703436345","article-title":"A subexponential-time quantum algorithm for the dihedral hidden subgroup problem","volume":"35","author":"Kuperberg","year":"2005","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2016.04.045_br0220","series-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1113","article-title":"The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups","author":"Moore","year":"2004"},{"key":"10.1016\/j.tcs.2016.04.045_br0230","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","article-title":"On the complexity of the parity argument and other inefficient proofs of existence","volume":"48","author":"Papadimitriou","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2016.04.045_br0240","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","article-title":"An improved algorithm for computing logarithms over GF(p) and its cryptographic significance","volume":"24","author":"Pohlig","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.tcs.2016.04.045_br0250","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1137\/S0097539703440678","article-title":"Quantum computation and lattice problems","volume":"33","author":"Regev","year":"2004","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2016.04.045_br0260","series-title":"Proceedings of the 2nd Manitoba Conference on Numerical Mathematics","first-page":"51","article-title":"Five number-theoretic algorithms","author":"Shanks","year":"1972"},{"key":"10.1016\/j.tcs.2016.04.045_br0270","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Algorithms for quantum computation: discrete logarithm and factoring","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"year":"1997","series-title":"Introduction to the Theory of Computation","author":"Sipser","key":"10.1016\/j.tcs.2016.04.045_br0280"},{"year":"2006","series-title":"Deterministic equation solving over finite fields","author":"van de Woestijne","key":"10.1016\/j.tcs.2016.04.045_br0290"},{"key":"10.1016\/j.tcs.2016.04.045_br0300","first-page":"76","article-title":"Bemerkung zur vorstehenden Arbeit von Herrn Chevalley","volume":"11","author":"Warning","year":"1936","journal-title":"Abh. Math. Semin. Univ. Hambg."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516302249?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516302249?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:21:28Z","timestamp":1656372088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516302249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":29,"alternative-id":["S0304397516302249"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.04.045","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving systems of diagonal polynomial equations over finite fields","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.04.045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}