Test complexity of generic polynomials
- 1 September 1992
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 8 (3) , 203-215
- https://doi.org/10.1016/0885-064x(92)90022-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Algebraic Complexity TheoryAnnual Review of Computer Science, 1988
- Additive Complexity and Zeros of Real PolynomialsSIAM Journal on Computing, 1985
- The complexity of partial derivativesTheoretical Computer Science, 1983
- Lower bounds for algebraic decision treesJournal of Algorithms, 1982
- An Extension of Strassen’s Degree BoundSIAM Journal on Computing, 1981
- A lower bound of 12n2 on linear search programs for the Knapsack problemJournal of Computer and System Sciences, 1978
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- The evaluation of polynomialsNumerische Mathematik, 1964