{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:13Z","timestamp":1742598613030,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540586913"},{"type":"electronic","value":"9783540490449"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58691-1_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:40:04Z","timestamp":1330274404000},"page":"80-92","source":"Crossref","is-referenced-by-count":0,"title":["Decomposition of algebraic functions"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]},{"given":"Susan","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Zippel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-15984-3_249","volume":"204","author":"V. S. Alagar","year":"1985","unstructured":"V. S. Alagar and M. Thanh, Fast polynomial decomposition algorithms, in Proc. EUROCAL85, Springer-Verlag Lect. Notes in Comput. Sci. 204,1985, pp. 150\u2013153.","journal-title":"Proc. EUROCAL85, Springer-Verlag Lect. Notes in Comput. Sci."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0747-7171(85)80012-2","volume":"1","author":"D. R. Barton","year":"1985","unstructured":"D. R. Barton and R. E. Zipfel, Polynomial decomposition algorithms, J. Symb. Comp., 1 (1985), pp. 159\u2013168.","journal-title":"J. Symb. Comp."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"G. A. Bliss, Algebraic Functions, Amer. Math. Soc., 1933.","DOI":"10.1090\/coll\/016"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1017\/S0305004100001110","volume":"68","author":"J. Coates","year":"1970","unstructured":"J. Coates, Construction of rational functions on a curve, Proc. Camb. Phil. Soc., 68 (1970), pp. 105\u2013123.","journal-title":"Proc. Camb. Phil. Soc."},{"key":"11_CR5","unstructured":"M. Dickerson, Polynomial decomposition algorithms for multivariate polynomials, Tech. Rep. TR87-826, Comput. Sci., Cornell Univ., April 1987."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"R. Hartshorne, Algebraic Geometry, vol. 52 of Graduate Texts in Mathematics, Springer, 1977.","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"M.-D. Huang and D. Ierardi, Efficient algorithms for the effective Riemann-Roch problem and for addition in the Jacobian of a curve, in Proc. 32nd Symp. Found. Comput. Sci., IEEE, November 1991, pp. 678\u2013687","DOI":"10.1109\/SFCS.1991.185435"},{"key":"11_CR8","unstructured":"D. Ierardi and D. Kozen, Parallel resultant computation, in Synthesis of Parallel Algorithms, J. Reif, ed., Morgan Kaufmann, 1993, pp. 679\u2013720."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0747-7171(89)80027-6","volume":"7","author":"D. Kozen","year":"1989","unstructured":"D. Kozen and S. Landau, Polynomial decomposition algorithms, J. Symb. Comput., 7 (1989), pp. 445\u2013456.","journal-title":"J. Symb. Comput."},{"key":"11_CR10","volume-title":"PhD thesis","author":"B. M. Trager","year":"1984","unstructured":"B. M. Trager, Integration of Algebraic Functions, PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, September 1984."},{"key":"11_CR11","unstructured":"B. L. van der Waerden, Algebra, vol. 2, Frederick Ungar, fifth ed., 1970."},{"key":"11_CR12","unstructured":"-, Algebra, vol. 1, Frederick Ungar, fifth ed., 1970."},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0747-7171(08)80014-4","volume":"9","author":"J. Gathen von zur","year":"1990","unstructured":"J. von zur Gathen, Functional decomposition of polynomials: the tame case, 3. Symb. Comput., 9 (1990), pp. 281\u2013299.","journal-title":"Symb. Comput."},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0747-7171(08)80054-5","volume":"10","author":"J. Gathen von zur","year":"1990","unstructured":"-Functional decomposition of polynomials: the wild case, J. Symb. Comput., 10 (1990), pp. 437\u2013452.","journal-title":"J. Symb. Comput."},{"key":"11_CR15","first-page":"1","volume-title":"International Symposium on Symbolic and Algebraic Computation","author":"R. E. Zippel","year":"1991","unstructured":"R. E. Zippel, Rational function decomposition, in International Symposium on Symbolic and Algebraic Computation, S. Watt, ed., New York, July 1991, ACM, pp. 1\u20136."},{"key":"11_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3188-3","volume-title":"Effective Polynomial Computation","author":"R. E. Zippel","year":"1993","unstructured":"Effective Polynomial Computation, Kluwer Academic Press, Boston, 1993."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58691-1_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:37:18Z","timestamp":1742596638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58691-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540586913","9783540490449"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58691-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}