{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T23:29:19Z","timestamp":1674084559808},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0304-3975(99)00291-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:39:08Z","timestamp":1027629548000},"page":"301-308","source":"Crossref","is-referenced-by-count":1,"title":["Factoring polynomials over arbitrary finite fields"],"prefix":"10.1016","volume":"234","author":[{"given":"Tanja","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00291-1_BIB1","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1002\/j.1538-7305.1967.tb03174.x","article-title":"Factoring polynomials over finite fields","volume":"46","author":"Berlekamp","year":"1967","journal-title":"Bell Systems Technol. J."},{"key":"10.1016\/S0304-3975(99)00291-1_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01272074","article-title":"Computing Frobenius maps and factoring polynomials","volume":"2","author":"von zur Gathen","year":"1992","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(99)00291-1_BIB3","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1090\/S0025-5718-98-00944-2","article-title":"Subquadratic-time factoring of polynomials over finite fields","volume":"67","author":"Kaltofen","year":"1998","journal-title":"Math. Comp."},{"key":"10.1016\/S0304-3975(99)00291-1_BIB4","first-page":"113","article-title":"Statistiques sur Fq[X]","volume":"19","author":"Mignotte","year":"1983","journal-title":"Ann. de l'Inst. Henri Poincar\u00e9"},{"key":"10.1016\/S0304-3975(99)00291-1_BIB5","series-title":"Mathematics for Computer Algebra","author":"Mignotte","year":"1992"},{"key":"10.1016\/S0304-3975(99)00291-1_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)80001-1","article-title":"Univariate polynomial factorization over finite fields","volume":"191","author":"Naudin","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00291-1_BIB7","doi-asserted-by":"crossref","unstructured":"W.M. Schmidt, Equations over finite fields, Lecture Notes in Mathematics, vol. 536, Springer, Berlin, 1976.","DOI":"10.1007\/BFb0080437"},{"key":"10.1016\/S0304-3975(99)00291-1_BIB8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(90)90195-4","article-title":"On the deterministic complexity of factoring polynomials over finite fields","volume":"33","author":"Shoup","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00291-1_BIB9","doi-asserted-by":"crossref","unstructured":"V. Shoup, A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic, Proc. 1991 Int. Symp. Symbolic and Algebraic Computation (ISSAC), pp. 14\u201321.","DOI":"10.1145\/120694.120697"},{"key":"10.1016\/S0304-3975(99)00291-1_BIB10","series-title":"Computational and Algorithmic Problems in Finite Fields","author":"Shparlinski","year":"1992"},{"key":"10.1016\/S0304-3975(99)00291-1_BIB11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1006\/ffta.1997.0199","article-title":"On the distribution of powers in finite fields","volume":"4","author":"Winterhof","year":"1998","journal-title":"Finite Fields Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002911?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002911?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T18:31:33Z","timestamp":1579199493000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397599002911"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00291-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}