On the complexity of the Gröbner-bases algorithm over K[x,y,z]
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 184-194
- https://doi.org/10.1007/bfb0032841
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Gröbner bases, Gaussian elimination and resolution of systems of algebraic equationsLecture Notes in Computer Science, 1983
- A note on the complexity of constructing Gröbner-basesLecture Notes in Computer Science, 1983
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970