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

Details:

   
TitleOn the Complexity of Computing Groebner Bases for Zero Dimensional Polynomial Ideals
Author(s) Y N Lakshman
TypeArticle in Conference Proceedings
Length7
LanguageEnglish
Pages227234
Year1991
MonthDecember
Edition0
Translation No
Refereed No
Institution Rensselaer Polytechnic Institute
ConferencenameMEGA
Webmaster