{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:14:06Z","timestamp":1725459246822},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019200X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039188","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T14:19:45Z","timestamp":1138198785000},"page":"139-156","source":"Crossref","is-referenced-by-count":0,"title":["FAST16 : A software program for factorising polynomials over large GF(p)"],"prefix":"10.1007","author":[{"given":"A.","family":"Poli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. C.","family":"Gennero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Algebraic coding theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp E.R. \"Algebraic coding theory\" MacGraw Hill, New York (1968)"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E.R. Berlekamp","year":"1970","unstructured":"BERLEKAMP E.R. \"Factoring polynomials over large finite fields\" Math. Comp. Vol 24, pp 713\u2013735 (1970)","journal-title":"Math. Comp."},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1112\/S0025579300001157","volume":"4","author":"D.A. Burgess","year":"1957","unstructured":"BURGESS D.A. \"The distribution of quadratic residues and non-residues\" Mathematika Vol 4, 106\u2013112 (1957)","journal-title":"Mathematika"},{"key":"16_CR4","first-page":"55","volume":"12","author":"P. Camion","year":"1982","unstructured":"CAMION P. \"Un algorithme de construction des idempotents primitifs d'id\u00e9aux sur IFq\" Annals of Discrete Math. Vol 12,55\u201363 (1982)","journal-title":"Annals of Discrete Math."},{"key":"16_CR5","first-page":"149","volume":"17","author":"P. Camion","year":"1983","unstructured":"CAMION P. \"A deterministic algorithm for factorising polynomials of IFq [X]\" Annals of Discrete Math. vol 17, 149\u2013157 (1983)","journal-title":"Annals of Discrete Math."},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"D.G. Cantor","year":"1981","unstructured":"CANTOR D.G. and ZASSENHAUS H. \"A new algorithm for factorising polynomials over finite fields\" Math. Comp. vol 36 154\u2013163 (1981)","journal-title":"Math. Comp."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"252","DOI":"10.5486\/PMD.1952.2.3-4.18","volume":"2","author":"H. Davenport","year":"1952","unstructured":"DAVENPORT H., ERDOS P. \"The distribution of quadratic and higher residues\" Publ. Math. Debrecen vol 2 252\u2013265 (1952)","journal-title":"Publ. Math. Debrecen"},{"key":"16_CR8","unstructured":"GOLOMB S.W., WELCH L.R., HALES A. \"On the factorisation of trinomials over GF (2)\" J.P.L. Memo 20\u2013189 (July 1959)"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0022-314X(71)90034-5","volume":"3","author":"R.H. Hudson","year":"1971","unstructured":"HUDSON R.H. \"On the sequences of consecutive quadratic non-residues\" J. of Number Theory, Vol 3 178\u2013181 (1971)","journal-title":"J. of Number Theory"},{"key":"16_CR10","unstructured":"KNUTH D.E. \"The Art of computer programming\", Vol 2 Seminumerical algorithms Addison-Wesley Publishing Company (2th Edition)"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/j.1538-7305.1965.tb01664.x","volume":"44","author":"F.J. MacWilliams","year":"1965","unstructured":"MacWILLIAMS F.J. \"The structure and properties of binary cyclic alphabets\" Bell System Technical J. Vol 44 303\u2013332 (1965)","journal-title":"Bell System Technical J."},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1977-0422193-8","volume":"31","author":"R.T. Moenck","year":"1977","unstructured":"MOENCK R.T. \"On the efficiency of algorithms for polynomial factoring\" Mathematics of computation, Vol 31 235\u2013250 (1977)","journal-title":"Mathematics of computation"},{"issue":"2\u20132","key":"16_CR13","first-page":"211","volume":"1","author":"A. Poli","year":"1984","unstructured":"POLI A., RIGONI C. \"Experimental comparison between softwares for binary polynomial factorisation\" (In French) Revue Traitement du Signal Vol 1no2\u20132 211\u2013215 (1984)","journal-title":"Revue Traitement du Signal"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"POLI A. \"Construction of primitive idempotents for n variable codes\" LNCS\/Springer Verlag, no228, 25\u201335 (1985)","DOI":"10.1007\/3-540-16767-6_48"},{"key":"16_CR15","unstructured":"RABIN M.O. \"Probabilistic algorithms in finite fields\" MIT\/LCS\/TR.213 (1979)"},{"issue":"3","key":"16_CR16","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/214748.214752","volume":"30","author":"R.E. Tarjan","year":"1987","unstructured":"TARJAN R.E., HOPCROFT J.E. \"An interview with the 1986 A.M. Turing award recipients\" Communications of the ACM vol 30 no 3 214\u2013222 (1987)","journal-title":"Communications of the ACM"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"ZASSENHAUS H.J. \"On Hensel factorisation\" J. Numb. Th. 291\u2013311 (1969)","DOI":"10.1016\/0022-314X(69)90047-X"}],"container-title":["Lecture Notes in Computer Science","Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039188.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T08:38:55Z","timestamp":1683362335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019200X"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0039188","relation":{},"subject":[]}}