Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleOn the Complexity of the Groebner-Bases Algorithm over K[x, y, z]
Author(s) Franz Winkler
TypeArticle in Conference Proceedings
ISBN3-540-13350-X
LanguageEnglish
JournalLecture Notes in Computer Science
Volume174
Pages184-194
PublisherSpringer-Verlag
AddressLondon, UK
Year1984
Translation No
Refereed No
Organization Johannes Kepler University Linz
Institution RISC (Research Institute for Symbolic Computation)
ConferencenameInternational Symposium on Symbolic and Algebraic Computation 1984
Webmaster