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

Details:

   
TitleCounting and Gröbner bases
Author(s) Kyriakos Kalorkoti
TypeArticle in Journal
AbstractWe show how the complexity of counting relates to the well known phenomenon that computing Gröbner bases under a lexicographic order is generally harder than total degree orders. We give simple examples of polynomials for which it is very easy to compute their Gröbner basis using a total degree order but for which exponential time is required for a lexicographic order. It follows that conversion algorithms do not help in such cases.
Length7
ISSN0747-7171
CopyrightAcademic Press
File
URL dx.doi.org/10.1006/jsco.2000.1575
LanguageEnglish
JournalJournal of Symbolic Computation
Volume31
Number3
Pages307-313
PublisherAcademic Press, Inc.
AddressDuluth, MN, USA
Year2001
MonthMarch
Translation No
Refereed No
Webmaster