{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T10:10:44Z","timestamp":1776766244798,"version":"3.51.2"},"publisher-location":"Berlin\/Heidelberg","reference-count":3,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540167838","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016248","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"247-255","source":"Crossref","is-referenced-by-count":22,"title":["Polynomial complexity of the Newton-Puiseux algorithm"],"prefix":"10.1007","author":[{"given":"A. L.","family":"Chistov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"47","volume":"260","author":"S.S. Abhyankar","year":"1973","unstructured":"S.S. Abhyankar and T.T. Moh. Newton-Puiseux expansion and generalized Tchirnhausen transformation. \u2014 J.reine angew.Math., 1973, vol.260, p.47\u201383 and 1973, vol.261, p.29\u201354.","journal-title":"J.reine angew.Math."},{"key":"19_CR2","first-page":"124","volume":"137","author":"\u0410.\u041b. \u0427\u0438\u0441\u0442\u043e\u0432","year":"1984","unstructured":"\u0410.\u041b. \u0427\u0438\u0441\u0442\u043e\u0432. \u0410\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u043f\u043e\u043b\u0438\u043d\u043e\u043c\u0438\u0430\u043b\u044a\u043d\u043e\u0439 \u0441\u043b\u043e\u0436\u043d\u043e\u0441\u0442\u0438 \u0434\u043b\u044f \u0440\u0430\u0437\u043b\u043e\u0436\u0435\u043d\u0438\u044f \u043c\u043d\u043e\u0433\u043e\u0447\u043b\u0435\u043d\u043e\u0432 \u0438 \u043d\u0430\u0445\u043e\u0436\u0434\u0435\u043d\u0438\u0435 \u043a\u043e\u043c\u043f\u043e\u043d\u0435\u043d\u0442 \u043c\u043d\u043e\u0433\u043e\u043e\u0431\u0440\u0430\u0437\u0438\u044f \u0432 \u0441\u0443\u0431\u044d\u043a\u0441\u043f\u043e\u043d\u0435\u043d\u0446\u0438\u0430\u043b\u044c\u043d\u043e\u0435 \u0432\u0440\u0435\u043c\u044f. \u2014 \u0417\u0430\u043f. \u043d\u0430\u0443\u0447\u043d. \u0441\u0435\u043c\u0438\u043d. \u041b\u041e\u041c\u0418, 1984, \u0442.137, \u0441.124\u2013188.","journal-title":"\u0417\u0430\u043f. \u043d\u0430\u0443\u0447\u043d. \u0441\u0435\u043c\u0438\u043d. \u041b\u041e\u041c\u0418"},{"issue":"2","key":"19_CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/322063.322068","volume":"25","author":"H.T. Kung","year":"1978","unstructured":"H.T. Kung and J.F. Traub. All algebraic functions can be computed fast. \u2014 J.Assoc.Comp.Mach., 1978, vol.25, N 2, p.245\u2013260.","journal-title":"J.Assoc.Comp.Mach."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016248.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:43Z","timestamp":1607549743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/bfb0016248","relation":{},"subject":[]}}