ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Border basis detection is NP-complete

Ananth, Prabhanjan Vijendra and Dukkipati, Ambedkar (2011) Border basis detection is NP-complete. In: ISSAC '11 Proceedings of the 36th international symposium on Symbolic and algebraic computation, 2011, New York, NY, USA.

[img] PDF
Symbolic_Alge_Com_11_2011.pdf - Published Version
Restricted to Registered users only

Download (543kB) | Request a copy
Official URL: http://dx.doi.org/10.1145/1993886.1993895


Border basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to some order ideal. The motivation for this problem comes from a similar problem related to Grobner bases termed as Grobner basis detection (GBD) which was proposed by Gritzmann and Sturmfels (1993). GBD was shown to be NP-hard by Sturmfels and Wiegelmann (1996). In this paper, we investigate the computational complexity of BBD and show that it is NP-complete.

Item Type: Conference Proceedings
Publisher: Association for Computing Machinery
Additional Information: Copyright of this article belongs to Association for Computing Machinery.
Keywords: Border Bases; Zero-Dimensional Ideals; Complexity; NP-Completeness
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 09 Mar 2013 10:46
Last Modified: 09 Mar 2013 10:46
URI: http://eprints.iisc.ac.in/id/eprint/46022

Actions (login required)

View Item View Item