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

researchr

You are not signed in
Sign in
Sign up

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.

Abstract is missing.

runs on WebDSL