{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:44:17Z","timestamp":1774529057142,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,9]]},"DOI":"10.1145\/1145768.1145781","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T12:53:01Z","timestamp":1153745581000},"page":"31-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Low complexity algorithms for linear recurrences"],"prefix":"10.1145","author":[{"given":"A.","family":"Bostan","sequence":"first","affiliation":[{"name":"Algorithms Project, Inria Rocquencourt, Le Chesnay, France"}]},{"given":"F.","family":"Chyzak","sequence":"additional","affiliation":[{"name":"Algorithms Project, Inria Rocquencourt, Le Chesnay, France"}]},{"given":"B.","family":"Salvy","sequence":"additional","affiliation":[{"name":"Algorithms Project, Inria Rocquencourt, Le Chesnay, France"}]},{"given":"T.","family":"Cluzeau","sequence":"additional","affiliation":[{"name":"Caf\u00e9 Project, Inria Sophia Antipolis, Sophia Antipolis, France"}]}],"member":"320","published-online":{"date-parts":[[2006,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Rational solutions of linear difference and q-difference equations with polynomial coefficients. Programming and computer software, 21(6):273--278","author":"Abramov S. A.","year":"1995","unstructured":"S. A. Abramov . Rational solutions of linear difference and q-difference equations with polynomial coefficients. Programming and computer software, 21(6):273--278 , 1995 . S. A. Abramov. Rational solutions of linear difference and q-difference equations with polynomial coefficients. Programming and computer software, 21(6):273--278, 1995."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780507"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/220346.220384"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00118-1"},{"key":"e_1_3_2_1_5_1","volume-title":"A treatise on the calculus of finite differences","author":"Boole G.","year":"1872","unstructured":"G. Boole . A treatise on the calculus of finite differences . Macmillan , London , 2 nd edition, 1872 . G. Boole. A treatise on the calculus of finite differences. Macmillan, London, 2nd edition, 1872.","edition":"2"},{"key":"e_1_3_2_1_6_1","unstructured":"A. Bostan F. Chyzak T. Cluzeau and B. Salvy. Fast algorithms for polynomial and rational solutions of linear operators equations In preparation.  A. Bostan F. Chyzak T. Cluzeau and B. Salvy. Fast algorithms for polynomial and rational solutions of linear operators equations In preparation."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073893"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24633-6_4"},{"key":"e_1_3_2_1_9_1","series-title":"Grundlehren der Mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic complexity theory","author":"B\u00fcrgisser P.","year":"1997","unstructured":"P. B\u00fcrgisser , M. Clausen , and M. A. Shokrollahi . Algebraic complexity theory , volume 315 of Grundlehren der Mathematischen Wissenschaften . Springer-Verlag , Berlin , 1997 . P. B\u00fcrgisser, M. Clausen, and M. A. Shokrollahi. Algebraic complexity theory, volume 315 of Grundlehren der Mathematischen Wissenschaften. Springer-Verlag, Berlin, 1997."},{"key":"e_1_3_2_1_10_1","first-page":"375","volume-title":"Ramanujan revisited","author":"Chudnovsky D. V.","year":"1988","unstructured":"D. V. Chudnovsky and G. V. Chudnovsky . Approximations and complex multiplication according to Ramanujan . In Ramanujan revisited , pages 375 -- 472 . Academic Press , Boston, MA , 1988 . D. V. Chudnovsky and G. V. Chudnovsky. Approximations and complex multiplication according to Ramanujan. In Ramanujan revisited, pages 375--472. Academic Press, Boston, MA, 1988."},{"key":"e_1_3_2_1_11_1","volume-title":"Modern computer algebra","author":"von zur Gathen J.","year":"1999","unstructured":"J. von zur Gathen and J. Gerhard . Modern computer algebra . Cambridge University Press , New York , 1999 . J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, New York, 1999."},{"key":"e_1_3_2_1_12_1","volume-title":"Modular algorithms in symbolic summation and symbolic integration. Number 3218 in Lecture Notes in Computer Science","author":"Gerhard J.","year":"2004","unstructured":"J. Gerhard . Modular algorithms in symbolic summation and symbolic integration. Number 3218 in Lecture Notes in Computer Science . Springer , 2004 . J. Gerhard. Modular algorithms in symbolic summation and symbolic integration. Number 3218 in Lecture Notes in Computer Science. Springer, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860887"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.75.1.40"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212017"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0747-7171(92)90038-6"},{"key":"e_1_3_2_1_17_1","volume-title":"Peters","author":"Petkov\u0161ek M.","year":"1996","unstructured":"M. Petkov\u0161ek , H. S. Wilf , and D. Zeilberger . A = B. A. K . Peters , Wellesley, MA , 1996 . M. Petkov\u0161ek, H. S. Wilf, and D. Zeilberger. A = B. A. K. Peters, Wellesley, MA, 1996."},{"key":"e_1_3_2_1_18_1","volume-title":"Bibliographisches Institut","author":"Sch\u00f6nhage A.","year":"1994","unstructured":"A. Sch\u00f6nhage , A. F. W. Grotefeld , and E. Vetter . Fast algorithms . Bibliographisches Institut , Mannheim , 1994 . A multitape Turing machine implementation. A. Sch\u00f6nhage, A. F. W. Grotefeld, and E. Vetter. Fast algorithms. Bibliographisches Institut, Mannheim, 1994. A multitape Turing machine implementation."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02100618"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80044-2"}],"event":{"name":"ISSAC06: International Symposium on Symbolic and Algebraic Computation","location":"Genoa Italy","acronym":"ISSAC06","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2006 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1145768.1145781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T17:01:23Z","timestamp":1673370083000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1145768.1145781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,9]]},"references-count":21,"alternative-id":["10.1145\/1145768.1145781","10.1145\/1145768"],"URL":"https:\/\/doi.org\/10.1145\/1145768.1145781","relation":{},"subject":[],"published":{"date-parts":[[2006,7,9]]},"assertion":[{"value":"2006-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}