Some Remarks on Bezout’s Theorem and Complexity Theory
作者： Michael Shub
DOI: 10.1007/978-1-4612-2740-3_40
关键词:
摘要: We begin by establishing the smoothness and irreducibility of certain algebraic varieties. Whereas these facts must be standard to geometers, they do not seem readily available.
springer.com
springerlink.com参考文章(12)
John Canny, Generalized Characteristic Polynomials international symposium on symbolic and algebraic computation. pp. 293- 299 ,(1988) , 10.1007/3-540-51084-2_28
Serge Lang, Elliptic Curves: Diophantine Analysis ,(1978)
Alan Baker, Transcendental Number Theory ,(1975)
John Canny, Generalised characteristic polynomials Journal of Symbolic Computation. ,vol. 9, pp. 241- 250 ,(1990) , 10.1016/S0747-7171(08)80012-0
Francis Sowerby Macaulay, The algebraic theory of modular systems ,(1994)
Michael Shub, On the distance to the zero set of a homogeneous polynomial Journal of Complexity. ,vol. 5, pp. 303- 305 ,(1989) , 10.1016/0885-064X(89)90027-7
James Renegar, On the worst-case arithmetic complexity of approximating zeros of systems of polynomials SIAM Journal on Computing. ,vol. 18, pp. 350- 370 ,(1989) , 10.1137/0218024
Walter Zulehner, A simple homotopy method for determining all isolated solutions to polynomial systems Mathematics of Computation. ,vol. 50, pp. 167- 177 ,(1988) , 10.1090/S0025-5718-1988-0917824-7
Richard Askey, Jonathan M. Borwein, Peter B. Borwein, Pi and the AGM ,(1987)
Lenore Blum, Mike Shub, Steve Smale, On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines Bulletin of the American Mathematical Society. ,vol. 21, pp. 1- 46 ,(1989) , 10.1090/S0273-0979-1989-15750-9