{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:39:35Z","timestamp":1776839975125,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540601142","type":"print"},{"value":"9783540494409","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60114-7_27","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:10Z","timestamp":1330278190000},"page":"347-364","source":"Crossref","is-referenced-by-count":3,"title":["Integration of multivariate rational functions given by straight-line programs"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"Matera","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(83)90110-X","volume":"22","author":"W. Baur","year":"1982","unstructured":"Baur W., Strassen V.: The complexity of partial derivatives. Theoret. Comput. Sci. 22 (1982) 317\u2013330.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S.J. Berkowitz","year":"1984","unstructured":"Berkowitz S.J.: On computing the determinant in small parallel time using a small number of processors. Information Processing Letter 18 (1984) 147\u2013150.","journal-title":"Information Processing Letter"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","volume":"52","author":"A. Borodin","year":"1982","unstructured":"Borodin A., von zur Gathen J., Hopcroft J.: Fast parallel matrix and GCD computations. Information and Control 52 (1982) 241\u2013256.","journal-title":"Information and Control"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Bronstein M.: Formulas for series computations. Applied Algebra in Engineering, Communication and Computing, AAECC 2, Springer-Verlag (1992) 195\u2013206.","DOI":"10.1007\/BF01294333"},{"key":"27_CR5","first-page":"1","volume":"No.375","author":"J.H. Davenport","year":"1983","unstructured":"Davenport J.H.: Int\u00e9gration Formelle. IMAG Reserch Report No.375 (1983) 1\u201323.","journal-title":"IMAG Reserch Report"},{"key":"27_CR6","unstructured":"Fitchas N., Giusti M. and Smietanski F.: Sur la complexit\u00e9 du th\u00e9or\u00e8me des z\u00e9ros. Preprint Ecole Polytechnique Palaiseau (1992)."},{"key":"27_CR7","first-page":"269","volume":"356","author":"J. Gathen von zur","year":"1989","unstructured":"von zur Gathen J.: Parallel algorithms for algebraic problems. Proc. 13-th. Conf. MFCS, Springer LN Comput. Sci. 356 (1989) 269\u2013300.","journal-title":"Proc. 13-th. Conf. MFCS, Springer LN Comput. Sci."},{"key":"27_CR8","unstructured":"Heintz J.: On the computational complexity of polynomials and bilinear mappings. A survey. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 5th Intern. Conf. AAECC-5, Menorca 1987, L. Huguet and A. Poli, eds., Springer LN Comput. Sci. 356 (1989) 269\u2013300."},{"key":"27_CR9","unstructured":"Heintz J. and Schnorr C.P.: Testing polynomials which are easy to compute, in: 12-th Ann. ACM Symp. Theory of Computing (1980) 262\u2013280."},{"issue":"1","key":"27_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/322358.322373","volume":"30","author":"O.H. Ibarra","year":"1983","unstructured":"Ibarra O.H. and Moran S.: Probabilistic algorithms for deciding equivalence of straight-line programs. J.ACM 30, 1 (1983) 217\u2013228.","journal-title":"J.ACM"},{"issue":"No.1","key":"27_CR11","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/42267.45069","volume":"35","author":"E. Kaltofen","year":"1988","unstructured":"Kaltofen E.: Greatest common divisors of polynomials given by Straight-line Programs. J.ACM 35 No. 1 (1988) 234\u2013264.","journal-title":"J.ACM"},{"key":"27_CR12","volume-title":"Algebra","author":"S. Lang","year":"1969","unstructured":"Lang S.: Algebra. Adisson-Wesley Publ. Comp., Reading, Massachusetts (1969)."},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90093-5","volume":"64","author":"H.J. Stoss","year":"1989","unstructured":"Stoss H.J.: On the representation of rational functions of bounded complexity. Theoret. Comput. Sci. 64 (1989) 1\u201313.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF00289512","volume":"1","author":"V. Strassen","year":"1972","unstructured":"Strassen V.: Berechnung und Programm I. Acta Inform.1 (1972) 320\u2013334.","journal-title":"Acta Inform."},{"key":"27_CR15","first-page":"182","volume":"264","author":"V. Strassen","year":"1973","unstructured":"Strassen V.: Vermeidung von Divisionen. J. reine u. angew. Math. vol. 264 (1973) 182\u2013202.","journal-title":"J. reine u. angew. Math."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60114-7_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:01Z","timestamp":1605646501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60114-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601142","9783540494409"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60114-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}