{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:39Z","timestamp":1750307319915,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T00:00:00Z","timestamp":1307491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,8]]},"DOI":"10.1145\/1993886.1993895","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"11-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Border basis detection is NP-complete"],"prefix":"10.1145","author":[{"given":"Prabhanjan Vijendra","family":"Ananth","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ambedkar","family":"Dukkipati","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Internat","first-page":"11","volume-title":"Numerical mathematics","author":"Auzinger W.","year":"1988","unstructured":"W. Auzinger and H. J. Stetter . An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations . In Numerical mathematics , Singapore 1988 , volume 86 of Internat . Schriftenreihe Numer. Math., pages 11 -- 30 . Birkhauser , Basel, 1988. W. Auzinger and H. J. Stetter. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. In Numerical mathematics, Singapore 1988, volume 86 of Internat. Schriftenreihe Numer. Math., pages 11--30. Birkhauser, Basel, 1988."},{"key":"e_1_3_2_1_2_1","volume-title":"Border bases and order ideals: a polyhedral characterization. arXiv:0912.1502v2","author":"Braun G.","year":"2010","unstructured":"G. Braun and S. Pokutta . Border bases and order ideals: a polyhedral characterization. arXiv:0912.1502v2 , 2010 . G. Braun and S. Pokutta. Border bases and order ideals: a polyhedral characterization. arXiv:0912.1502v2, 2010."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0406019"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2004.08.028"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2005.07.006"},{"key":"e_1_3_2_1_6_1","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-27357-3_4","volume-title":"Solving Polynomial Equations","author":"Kehrein A.","year":"2005","unstructured":"A. Kehrein , M. Kreuzer , and L. Robbiano . An algebraist's view on border bases . In Solving Polynomial Equations , volume 14 of Algorithms and Computation in Mathematics , pages 169 -- 202 . Springer Berlin Heidelberg , December 2005 . A. Kehrein, M. Kreuzer, and L. Robbiano. An algebraist's view on border bases. In Solving Polynomial Equations, volume 14 of Algorithms and Computation in Mathematics, pages 169--202. Springer Berlin Heidelberg, December 2005."},{"key":"e_1_3_2_1_7_1","volume-title":"Computational Commutative Algebra 2","author":"Kreuzer M.","year":"2005","unstructured":"M. Kreuzer and L. Robbiano . Computational Commutative Algebra 2 . Springer-Verlag , Heidelberg , 2005 . M. Kreuzer and L. Robbiano. Computational Commutative Algebra 2. Springer-Verlag, Heidelberg, 2005."},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes In Computer Science","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/3-540-46796-3_41","volume-title":"A new criterion for normal form algorithms","author":"Mourrain B.","year":"1999","unstructured":"B. Mourrain . A new criterion for normal form algorithms . In Lecture Notes In Computer Science ; Vol. 1719 , pages 430 -- 443 . Springer-Verlag , London ,UK, 1999 . B. Mourrain. A new criterion for normal form algorithms. In Lecture Notes In Computer Science; Vol. 1719, pages 430 -- 443. Springer-Verlag, London,UK, 1999."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073920"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002000050063"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90081-7"}],"event":{"name":"ISSAC '11: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"San Jose California USA","acronym":"ISSAC '11"},"container-title":["Proceedings of the 36th international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993886.1993895","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993886.1993895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:52Z","timestamp":1750244752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993886.1993895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,8]]},"references-count":12,"alternative-id":["10.1145\/1993886.1993895","10.1145\/1993886"],"URL":"https:\/\/doi.org\/10.1145\/1993886.1993895","relation":{},"subject":[],"published":{"date-parts":[[2011,6,8]]},"assertion":[{"value":"2011-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}