On the complexity of computing grobner bases for zero-dimensional polynomial ideals
Year: 1990
Type: article
Authors: Erich Kaltofen, Lakshman Yagati
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W1493801153
