Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
401613 | Journal of Symbolic Computation | 2009 | 13 Pages |
Abstract
A polynomial invariant under the action of a finite group can be rewritten using generators of the invariant ring. We investigate the complexity aspects of this rewriting process; we show that evaluation techniques enable one to reach a polynomial cost.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence