|
Informatics Report Series
|
|
|
|
|
|
|
|
|
| Title:Counting and Groebner Bases |
| Authors:
Kyriakos Kalorkoti
|
| Date: 2001 |
| Publication Title:Journal of Symbolic Computation |
| Publisher:Elsevier |
|
Publication Type:Journal Article
Publication Status:Published
|
|
Volume No:# 31(3)
Page Nos:307-313
|
|
DOI:10.1006/jsco.2000.1575
|
- Abstract:
-
We show how the compexity of counting relates to the well known phenomenon that computing Groebner basses under a lexicographic order is generally harder than total degree orders. We give simple expamples of polynomials for which it is very easy to compute their Groebner basis using a total degree order but for which exponential time is required for a lexicogrphic order. It follows that conversion algorithms do not help in such cases.
- Links To Paper
- No links available
- Bibtex format
- @Article{EDI-INF-RR-0336,
- author = {
Kyriakos Kalorkoti
},
- title = {Counting and Groebner Bases},
- journal = {Journal of Symbolic Computation},
- publisher = {Elsevier},
- year = 2001,
- volume = {# 31(3)},
- pages = {307-313},
- doi = {10.1006/jsco.2000.1575},
- }
|
