|Title||Fundamental Problems of Algorithmic Algebra|
|Author(s)|| Chee K. Yap|
|Type||Book, Chapter in Book, Conference Proceeding|
|Abstract||The Fundamental Theorem of Algebra says that|
a complex polynomial of degree d has exactly
d complex zeros. Finding these zeroes may
be called the Fundamental Problem of Algorithmic Algebra.
This book's title suggest that it is about
various generalizations of this fundamental problem:
from solving multivariate polynomial systems
to ideal membership.
The book is unique in its emphasis on bounds --
from multivariate zero bounds to degree
bounds on ideal membership and in Groebner bases.
It also has a nice treatment of subresultant theory.
Some original material includes
a generalized Sturm theory and
|Keywords||Fundamental Problem of Algorithmic Algebra, Ideal Bounds, Double Exponential Degree Bounds for Groebner Bases, multvariate zero bounds|
|Publisher||Oxford University Press|
|Note||See http://cs.nyu.edu/yap/book/ for downloadable preliminary version|