Complexity of Bezout's theorem V: polynomial time
- 10 October 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 133 (1) , 141-164
- https://doi.org/10.1016/0304-3975(94)90122-8
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- COMPLEXITY OF BEZOUT'S THEOREM IV: PROBABILITY OF SUCCESS; EXTENSIONSPublished by World Scientific Pub Co Pte Ltd ,2000
- Algorithms for Solving EquationsPublished by World Scientific Pub Co Pte Ltd ,2000
- Complexity of Bezout′s TheoremJournal of Complexity, 1993
- On the Work of Steve Smale on the Theory of ComputationPublished by Springer Nature ,1993
- The kinematic formula in Riemannian homogeneous spacesMemoirs of the American Mathematical Society, 1993
- Some Remarks on the Foundations of Numerical AnalysisSIAM Review, 1990
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: IISIAM Journal on Computing, 1986
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981
- GEOMETRIC MEASURE THEORYBulletin of the London Mathematical Society, 1971