Details:
| Title | On the Complexity of Computing Groebner Bases for Zero Dimensional Polynomial Ideals | | Author(s) | Y N Lakshman | | Type | Article in Conference Proceedings | | Length | 7 |
| Language | English | | Pages | 227–234 | | Year | 1991 | | Month | December | | Edition | 0 | | Translation |
No | | Refereed |
No | | Institution |
Rensselaer Polytechnic Institute | | Conferencename | MEGA |
|
