{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T02:40:04Z","timestamp":1751164804547,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_19","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T09:35:54Z","timestamp":1513762554000},"page":"264-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Bit-Size of Non-radical Triangular Sets"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Dahan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"1\u20132","key":"19_CR1","first-page":"45","volume":"28","author":"P Aubry","year":"1999","unstructured":"Aubry, P., Lazard, D., Moreno Maza, M.: On the theories of triangular sets. J. Symb. Comput. 28(1\u20132), 45\u2013124 (1999)","journal-title":"J. Symb. Comput."},{"issue":"6","key":"19_CR2","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.jsc.2011.12.023","volume":"47","author":"C Chen","year":"2012","unstructured":"Chen, C., Moreno-Maza, M.: Algorithms for computing triangular decomposition of polynomial systems. J. Symb. Comput. 47(6), 610\u2013642 (2012)","journal-title":"J. Symb. Comput."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Dahan, X.: Size of coefficients of lexicographical Gr\u00f6bner baes. In: ISSAC 2009, pp. 117\u2013126. ACM (2009)","DOI":"10.1145\/1576702.1576721"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Dahan, X., Schost, \u00c9.: Sharp estimates for triangular sets. In: ISSAC 2004, pp. 103\u2013110. ACM Press (2004)","DOI":"10.1145\/1005285.1005302"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Dahan, X.: GCD modulo a primary triangular set of dimension zero. In: Proceedings of ISSAC 2017, pp. 109\u2013116. ACM, New York (2017)","DOI":"10.1145\/3087604.3087612"},{"key":"19_CR6","unstructured":"Moreno Maza, M., Lemaire, F., Xie, Y.: The RegularChains library (2005)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45084-X_1","volume-title":"Symbolic and Numerical Scientific Computation","author":"E Hubert","year":"2003","unstructured":"Hubert, E.: Notes on triangular sets and triangulation-decomposition algorithms I: polynomial systems. In: Winkler, F., Langer, U. (eds.) SNSC 2001. LNCS, vol. 2630, pp. 1\u201339. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45084-X_1"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Mantzaflaris, A., Schost, \u00c9., Tsigaridas, E.: Sparse rational univariate representation. In: ISSAC 2017, p. 8 (2017)","DOI":"10.1145\/3087604.3087653"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.jco.2015.11.009","volume":"34","author":"E Mehrabi","year":"2016","unstructured":"Mehrabi, E., Schost, \u00c9.: A softly optimal monte carlo algorithm for solving bivariate polynomial systems over the integers. J. Complex. 34, 78\u2013128 (2016)","journal-title":"J. Complex."},{"issue":"5","key":"19_CR10","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s002000050114","volume":"9","author":"F Rouillier","year":"1999","unstructured":"Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. Appl. Algebra Eng. Commun. Comput. 9(5), 433\u2013461 (1999)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"19_CR11","series-title":"Texts and Monographs in Symbolic Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6202-6","volume-title":"Elimination Methods","author":"D Wang","year":"2012","unstructured":"Wang, D.: Elimination Methods. Texts and Monographs in Symbolic Computation. Springer, Vienna (2012). https:\/\/doi.org\/10.1007\/978-3-7091-6202-6"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Yamashita, T., Dahan, X.: Bit-size reduction of triangular sets in two and three variables. In: SCSS 2016. EPiC Series in Computing, vol. 39, pp. 169\u2013182 (2016)","DOI":"10.29007\/nz5x"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T02:10:14Z","timestamp":1751163014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}