Some complexity results for prefix Gröbner bases in free monoid rings.

Andrea Sattler-Klein

Published in: Theor. Comput. Sci. (2010)

Keyphrases

numerically stable
worst case
data structure
computational complexity
lower complexity
real time
computer vision
polynomial equations
real world
computational cost