On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal

Yagati N. Lakshman. On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, 14-16 May 1990, Baltimore, Maryland, USA. pages 555-563, ACM, 1990.

@inproceedings{Lakshman90,
  title = {On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal},
  author = {Yagati N. Lakshman},
  year = {1990},
  researchr = {https://researchr.org/publication/Lakshman90},
  cites = {0},
  citedby = {0},
  pages = {555-563},
  booktitle = {Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, 14-16 May 1990, Baltimore, Maryland, USA},
  publisher = {ACM},
}