{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:35:31Z","timestamp":1726072531897},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_12","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"138-152","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Chordality of Simple Decomposition in Top-Down Style"],"prefix":"10.1007","author":[{"given":"Chenqi","family":"Mou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahua","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"issue":"1\u20132","key":"12_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jsco.1999.0269","volume":"28","author":"P Aubry","year":"1999","unstructured":"Aubry, P., Lazard, D., Moreno Maza, M.: On the theories of triangular sets. J. Symbolic Comput. 28(1\u20132), 105\u2013124 (1999)","journal-title":"J. Symbolic Comput."},{"key":"12_CR2","unstructured":"B\u00e4chler, T.: Counting solutions of algebraic systems via triangular decomposition. Ph.D. thesis, RWTH Aachen University (2014)"},{"issue":"10","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1016\/j.jsc.2011.12.043","volume":"47","author":"T B\u00e4chler","year":"2012","unstructured":"B\u00e4chler, T., Gerdt, V., Lange-Hegermann, M., Robertz, D.: Algorithmic Thomas decomposition of algebraic and differential systems. J. Symbolic Comput. 47(10), 1233\u20131266 (2012)","journal-title":"J. Symbolic Comput."},{"key":"12_CR4","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Ph.D. thesis, Universit\u00e4t Innsbruck, Austria (1965)"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s11424-008-9103-0","volume":"21","author":"F Chai","year":"2008","unstructured":"Chai, F., Gao, X.S., Yuan, C.: A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers. J. Syst. Sci. Complex. 21(2), 191\u2013208 (2008)","journal-title":"J. Syst. Sci. Complex."},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","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 decompositions of polynomial systems. J. Symbolic Comput. 47(6), 610\u2013642 (2012)","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/16M106995X","volume":"1","author":"D Cifuentes","year":"2017","unstructured":"Cifuentes, D., Parrilo, P.A.: Chordal networks of polynomial ideals. SIAM J. Appl. Algebra Geom. 1(1), 73\u2013110 (2017)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Using Algebraic Geometry. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/978-1-4757-6911-1","DOI":"10.1007\/978-1-4757-6911-1"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases ($${F_4}$$). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Gao, X.S., Jiang, K.: Order in solving polynomial equations. In: Gao, X.S., Wang, D. (eds.) Computer Mathematics, Proceedings of ASCM 2000, pp. 308\u2013318. World Scientific (2000)","DOI":"10.1142\/9789812791962_0042"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Gao, X.S., Chou, S.C.: Solving parametric algebraic systems. In: Wang, P. (ed.) Proceedings of ISSAC 1992, pp. 335\u2013341. ACM (1992)","DOI":"10.1145\/143242.143348"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.aam.2015.09.005","volume":"72","author":"V Gerdt","year":"2016","unstructured":"Gerdt, V., Robertz, D.: Lagrangian constraints and differential Thomas decomposition. Adv. Appl. Math. 72, 113\u2013138 (2016)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/S0895479887139455","volume":"15","author":"JR Gilbert","year":"1994","unstructured":"Gilbert, J.R.: Predicting structure in sparse matrix computations. SIAM J. Matrix Anal. Appl. 15(1), 62\u201379 (1994)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-21969-6_5","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"Z Huang","year":"2011","unstructured":"Huang, Z., Lin, D.: Attacking Bivium and Trivium with the characteristic set method. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 77\u201391. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21969-6_5"},{"key":"12_CR15","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). \nhttps:\/\/doi.org\/10.1007\/3-540-45084-X_1"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/jsco.1993.1011","volume":"15","author":"M Kalkbrener","year":"1993","unstructured":"Kalkbrener, M.: A generalized Euclidean algorithm for computing triangular representations of algebraic varieties. J. Symbolic Comput. 15(2), 143\u2013167 (1993)","journal-title":"J. Symbolic Comput."},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2012.11.009","volume":"468","author":"C Mou","year":"2013","unstructured":"Mou, C., Wang, D., Li, X.: Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case. Theoret. Comput. Sci. 468, 102\u2013113 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-91938-6_10","volume-title":"Algorithms for Computational Biology","author":"C Mou","year":"2018","unstructured":"Mou, C.: Symbolic detection of steady states of autonomous differential biological systems by transformation into block triangular form. In: Jansson, J., Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A. (eds.) AlCoB 2018. LNCS, vol. 10849, pp. 115\u2013127. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91938-6_10"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Mou, C., Bai, Y.: On the chordality of polynomial sets in triangular decomposition in top-down style. In: Arreche, C. (ed.) Proceedings of ISSAC 2018, pp. 287\u2013294. ACM (2018)","DOI":"10.1145\/3208976.3208997"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Mou, C., Bai, Y., Lai, J.: Chordal graphs in triangular decomposition in top-down style. J. Symbolic Comput. (2019, to appear)","DOI":"10.1016\/j.jsc.2019.10.011"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/1003021","volume":"3","author":"S Parter","year":"1961","unstructured":"Parter, S.: The use of linear graphs in Gauss elimination. SIAM Rev. 3(2), 119\u2013130 (1961)","journal-title":"SIAM Rev."},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"DJ Rose","year":"1970","unstructured":"Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32(3), 597\u2013609 (1970)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/jsco.1993.1035","volume":"16","author":"D Wang","year":"1993","unstructured":"Wang, D.: An elimination method for polynomial systems. J. Symbolic Comput. 16(2), 83\u2013114 (1993)","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jsco.1997.0177","volume":"25","author":"D Wang","year":"1998","unstructured":"Wang, D.: Decomposing polynomial systems into simple systems. J. Symbolic Comput. 25(3), 295\u2013314 (1998)","journal-title":"J. Symbolic Comput."},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jsco.1999.0355","volume":"30","author":"D Wang","year":"2000","unstructured":"Wang, D.: Computing triangular systems and regular systems. J. Symbolic Comput. 30(2), 221\u2013236 (2000)","journal-title":"J. Symbolic Comput."},{"key":"12_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6202-6","volume-title":"Elimination Methods","author":"D Wang","year":"2001","unstructured":"Wang, D.: Elimination Methods. Springer, Wien (2001). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-6202-6"},{"issue":"1","key":"12_CR28","first-page":"1","volume":"31","author":"WT Wu","year":"1986","unstructured":"Wu, W.T.: On zeros of algebraic equations: An application of Ritt principle. Kexue Tongbao 31(1), 1\u20135 (1986)","journal-title":"Kexue Tongbao"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Wu, W.T.: Mechanical Theorem Proving in Geometries: Basic Principles. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-6639-0","DOI":"10.1007\/978-3-7091-6639-0"},{"key":"12_CR30","first-page":"147","volume-title":"Artificial Intelligence in Mathematics","author":"L Yang","year":"1994","unstructured":"Yang, L., Zhang, J.Z.: Searching dependency between algebraic equations: An algorithm applied to automated reasoning. In: Johnson, J., McKee, S., Vella, A. (eds.) Artificial Intelligence in Mathematics, pp. 147\u2013156. Oxford University Press, Oxford (1994)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:14:39Z","timestamp":1584490479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}