Border basis detection is NP-complete
| Data(s) |
2011
|
|---|---|
| Resumo |
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. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/46022/1/Symbolic_Alge_Com_11_2011.pdf 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. |
| Publicador |
Association for Computing Machinery |
| Relação |
http://dx.doi.org/10.1145/1993886.1993895 http://eprints.iisc.ernet.in/46022/ |
| Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
| Tipo |
Conference Proceedings PeerReviewed |
