{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:46:58Z","timestamp":1750308418450,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T00:00:00Z","timestamp":1656892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Competitiveness, Entrepreneurship & Innovation","award":["MIS 5002550"],"award-info":[{"award-number":["MIS 5002550"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,4]]},"DOI":"10.1145\/3476446.3536189","type":"proceedings-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T13:16:01Z","timestamp":1657026961000},"page":"255-262","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounding the Number of Roots of Multi-Homogeneous Systems"],"prefix":"10.1145","author":[{"given":"Evangelos","family":"Bartzos","sequence":"first","affiliation":[{"name":"Department of Informatics and Telecommunications NKUA & ATHENA Research Center, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis Z.","family":"Emiris","sequence":"additional","affiliation":[{"name":"ATHENA Research Center & Department of Informatics and Telecommunications NKUA, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilias S.","family":"Kotsireas","sequence":"additional","affiliation":[{"name":"ATHENA Research Center, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charalambos","family":"Tzamos","sequence":"additional","affiliation":[{"name":"Department of Informatics and Telecommunications NKUA, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Applications of graph and hypergraph theory in geometry. Combinatorial and computational geometry, 52:31--50","author":"B\u00e1r\u00e1ny I.","year":"2005","unstructured":"I. B\u00e1r\u00e1ny . Applications of graph and hypergraph theory in geometry. Combinatorial and computational geometry, 52:31--50 , 2005 . I. B\u00e1r\u00e1ny. Applications of graph and hypergraph theory in geometry. Combinatorial and computational geometry, 52:31--50, 2005."},{"key":"e_1_3_2_1_2_1","first-page":"31","article-title":"On the multihomogeneous B\u00e9zout bound on the number of embeddings of minimally rigid graphs. J. Applicable Algebra in Engineering","author":"Bartzos E.","year":"2020","unstructured":"E. Bartzos , I.Z. Emiris , and J. Schicho . On the multihomogeneous B\u00e9zout bound on the number of embeddings of minimally rigid graphs. J. Applicable Algebra in Engineering , Communication & Computing , 31 , 2020 . URL: https:\/\/doi.org\/10.1007\/s00200-020-00447--7. 10.1007\/s00200-020-00447--7 E. Bartzos, I.Z. Emiris, and J. Schicho. On the multihomogeneous B\u00e9zout bound on the number of embeddings of minimally rigid graphs. J. Applicable Algebra in Engineering, Communication & Computing, 31, 2020. URL: https:\/\/doi.org\/10.1007\/s00200-020-00447--7.","journal-title":"Communication & Computing"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85165-1_2"},{"key":"e_1_3_2_1_4_1","volume-title":"New upper bounds for the number of embeddings of minimally rigid graphs. arXiv:2010.10578 [math.CO]","author":"Bartzos E.","year":"2020","unstructured":"E. Bartzos , I.Z. Emiris , and R. Vidunas . New upper bounds for the number of embeddings of minimally rigid graphs. arXiv:2010.10578 [math.CO] , 2020 . E. Bartzos, I.Z. Emiris, and R. Vidunas. New upper bounds for the number of embeddings of minimally rigid graphs. arXiv:2010.10578 [math.CO], 2020."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322389"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01075595"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0609043"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/151002666"},{"key":"e_1_3_2_1_9_1","series-title":"Algorithms and Computation in Mathematics","volume-title":"Solving polynomial equations","author":"Dickenstein A.","year":"2005","unstructured":"A. Dickenstein and I.Z. Emiris , editors . Solving polynomial equations , volume 14 of Algorithms and Computation in Mathematics . Springer-Verlag , Berlin , 2005 . Foundations, algorithms, and applications. A. Dickenstein and I.Z. Emiris, editors. Solving polynomial equations, volume 14 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, 2005. Foundations, algorithms, and applications."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00462-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)90045-P"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.33"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01077562"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01389769"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465520"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1322-y"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.10.011"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/164081.164120"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt224"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2843512"},{"key":"e_1_3_2_1_22_1","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell S. J.","year":"2020","unstructured":"S. J. Russell and P. Norvig . Artificial Intelligence: A Modern Approach ( 4 th Edition). Pearson, 2020 . URL : http:\/\/aima.cs.berkeley.edu\/. S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach (4th Edition). Pearson, 2020. URL: http:\/\/aima.cs.berkeley.edu\/.","edition":"4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"I.R. Shafarevich. Intersection Numbers pages 233--283. Springer Berlin Heidelberg 2013.  I.R. Shafarevich. Intersection Numbers pages 233--283. Springer Berlin Heidelberg 2013.","DOI":"10.1007\/978-3-642-37956-7_4"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1142\/5763"},{"key":"e_1_3_2_1_26_1","volume-title":"Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results. ArXiv, abs\/1109.5714","author":"Stergiou K.","year":"2005","unstructured":"K. Stergiou and N. Samaras . Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results. ArXiv, abs\/1109.5714 , 2005 . K. Stergiou and N. Samaras. Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results. ArXiv, abs\/1109.5714, 2005."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp467"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1700400"},{"key":"e_1_3_2_1_30_1","first-page":"1601","volume-title":"Proceedings of the 19th International Conference on Neural Information Processing Systems, NIPS'06","author":"Zhou D.","year":"2006","unstructured":"D. Zhou , J. Huang , and B. Sch\u00f6lkopf . Learning with hypergraphs: Clustering, classification, and embedding . In Proceedings of the 19th International Conference on Neural Information Processing Systems, NIPS'06 , page 1601 -- 1608 , Cambridge, MA, USA , 2006 . MIT Press. D. Zhou, J. Huang, and B. Sch\u00f6lkopf. Learning with hypergraphs: Clustering, classification, and embedding. In Proceedings of the 19th International Conference on Neural Information Processing Systems, NIPS'06, page 1601--1608, Cambridge, MA, USA, 2006. MIT Press."}],"event":{"name":"ISSAC '22: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Villeneuve-d'Ascq France","acronym":"ISSAC '22"},"container-title":["Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476446.3536189","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476446.3536189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:20Z","timestamp":1750268960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476446.3536189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,4]]},"references-count":28,"alternative-id":["10.1145\/3476446.3536189","10.1145\/3476446"],"URL":"https:\/\/doi.org\/10.1145\/3476446.3536189","relation":{},"subject":[],"published":{"date-parts":[[2022,7,4]]},"assertion":[{"value":"2022-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}