Strassen’s lower bound for polynomial evaluation and Bezout’s theorem
نویسنده
چکیده
Strassen’s lower bound for polynomial evaluation and Bezout’s theorem Recall Strassen’s algorithm from the previous lecture: Given: (a0, . . . , an−1), (x1, . . . , xn) ∈ K, and polynomial p(x) = ∑n−1 i=0 aix i Task: find (z1, . . . , zn), zi = p(xi) How many steps do we need to accomplish this task? Using the Fast Fourier Transform (FFT) we need O(n log n) steps. Strassen was interested whether it can be done faster, and he showed that Ω(n logn) steps are needed in algebraic computation trees.
منابع مشابه
On the Intersection of Acm Curves in P
Bezout’s theorem gives us the degree of intersection of two properly intersecting projective varieties. As two curves in P never intersect properly, Bezout’s theorem cannot be directly used to bound the number of intersection points of such curves. In this work, we bound the maximum number of intersection points of two integral ACM curves in P. The bound that we give is in many cases optimal as...
متن کاملThe Expected Number of Real Roots of a Multihomogeneous System of Polynomial Equations
The methods of Shub and Smale [SS93] are extended to the class of multihomogeneous systems of polynomial equations, yielding Theorem 1, which is a formula expressing the mean (with respect to a particular distribution on the space of coefficient vectors) number of real roots as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form expressions...
متن کاملOn the Classification of Exceptional Planar Functions over $\mathbb{F}_{p}$
We will present many strong partial results towards a classification of exceptional planar/PN monomial functions on finite fields. The techniques we use are the Weil bound, Bezout’s theorem, and Bertini’s theorem.
متن کاملBezout Curves in the Plane
First, recall how Bezout’s Theorem can be made more precise by specifying the meaning of the word “generically” used above, using elementary scheme-theoretic language ([H, II]). Fix an algebraically closed field k. There is little loss in assuming k = C (until Section 3). Since we work over an algebraically closed field, we often identify reduced algebraic sets with their k-valued points. In th...
متن کاملComplexity of Bezout’s Theorem Iv: Probability of Success; Extensions
Michael Shub and Steve Smale Abstra t. We estimate the probability that a given number of projective Newton steps applied to a linear homotopy of a system of n homogeneous polynomial equations in n + 1 complex variables of fixed degrees will find all the roots of the system. We also extend the framework of our analysis to cover the classical implicit function theorem and revisit the condition n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005