The average number of real zeros of a random polynomial
β Scribed by D. C. Stevens
- Publisher
- John Wiley and Sons
- Year
- 1969
- Tongue
- English
- Weight
- 572 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We develop a probabilistic polynomial time algorithm which on input a polynomial \(g\left(x_{1}, \ldots, x_{n}\right)\) over \(G F[2], \epsilon\) and \(\delta\), outputs an approximation to the number of zeroes of \(g\) with relative error at most \(\epsilon\) with probability at least \(1-\delta\).
The classical EnestΓΆm-Kekeya Theorem states that a polynomial \(p(z)=\) \(\sum_{i=0}^{n} a_{i} z^{\prime}\) satisfying \(0<a_{0} \leq a_{1} \leq \cdots \leq a_{n}\) has all its zeros in \(|z| \leq 1\). We extend this result to a larger class of polynomials by dropping the conditions that the coeffic