-
1
-
-
0003615227
-
-
Springer- Verlag, New York, MR1479636 99a:68070
-
L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and real computation, Springer- Verlag, New York, 1998. MR1479636 (99a:68070)
-
(1998)
Complexity and Real Computation
-
-
Blum, L.1
Cucker, F.2
Shub, M.3
Smale, S.4
-
2
-
-
77950551755
-
-
Foundations of Computational Mathematics: Santander, L. Pardo, A. Pinkus, E. Süli, M. Todd, editors, Cambridge University Press, 2006, MR2277103 2008a:65097
-
C. Beltrán and L. M. Pardo, On the complexity of non-universal polynomial equation solving: old and new results, Foundations of Computational Mathematics: Santander 2005. L. Pardo, A. Pinkus, E. Süli, M. Todd, editors, Cambridge University Press, 2006, pp. 1-35. MR2277103 (2008a:65097)
-
(2005)
On the Complexity of Non-universal Polynomial Equation Solving: Old and New Results
, pp. 1-35
-
-
Beltrán, C.1
Pardo, L.M.2
-
3
-
-
43049141551
-
On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
-
electronic. MR2299780 2008d:65053
-
C. Beltran and L. M. Pardo, On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case, Math. Comp. 76 (2007), no. 259, 1393-1424 (electronic). MR2299780 (2008d:65053)
-
(2007)
Math. Comp
, vol.76
, Issue.259
, pp. 1393-1424
-
-
Beltran, C.1
Pardo, L.M.2
-
4
-
-
33846869297
-
Estimates on the distribution of the condition number of singular matrices
-
MR2283343 2008b:65059
-
C. Beltrán and L. M. Pardo, Estimates on the distribution of the condition number of singular matrices, Found. Comput. Math. 7 (2007), no. 1, 87-134. MR2283343 (2008b:65059)
-
(2007)
Found. Comput. Math
, vol.7
, Issue.1
, pp. 87-134
-
-
Beltrán, C.1
Pardo, L.M.2
-
5
-
-
44249086976
-
On Smale's 17th problem: A probabilistic positive solution
-
MR2403529
-
C. Beltrán and L. M. Pardo, On Smale's 17th problem: a probabilistic positive solution, Found. Comput. Math. 8 (2008), no. 1, 1-43. MR2403529
-
(2008)
Found. Comput. Math
, vol.8
, Issue.1
, pp. 1-43
-
-
Beltrán, C.1
Pardo, L.M.2
-
7
-
-
84968516134
-
On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
-
N. S., MR974426 90a:68022
-
[L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. (N. S.) 21 (1989), no. 1, 1-46. MR974426 (90a:68022)
-
(1989)
Bull. Amer. Math. Soc.
, vol.21
, Issue.1
, pp. 1-46
-
-
Blum, L.1
Shub, M.2
Smale, S.3
-
8
-
-
0041103739
-
Time bounded computations over the reals
-
MR1189670 93m:03067
-
F. Cucker, J. L. Montaña, and L. M. Pardo, Time bounded computations over the reals, Internat. J. Algebra Comput. 2 (1992), no. 4, 395-408. MR1189670 (93m:03067)
-
(1992)
Internat. J. Algebra Comput
, vol.2
, Issue.4
, pp. 395-408
-
-
Cucker, F.1
Montaña, J.L.2
Pardo, L.M.3
-
9
-
-
77950576100
-
-
Number-theoretic and algebraic methods in computer science, Moscow, World Sci. Publ., River Edge, NJ, MR1377740 97b:68067
-
Models for parallel computation with real numbers, Number-theoretic and algebraic methods in computer science (Moscow, 1993), World Sci. Publ., River Edge, NJ, 1995, pp. 53-63. MR1377740 (97b:68067)
-
(1993)
Models for Parallel Computation with Real Numbers
, pp. 53-63
-
-
-
10
-
-
0020495011
-
A taxonomy of problems with fast parallel algorithms
-
MR837088 87k:68043
-
Stephen A. Cook, A taxonomy of problems with fast parallel algorithms, Inform. and Control 64 (1985), no. 1-3, 2-22. MR837088 (87k:68043)
-
(1985)
Inform. and Control
, vol.64
, Issue.1-3
, pp. 2-22
-
-
Stephen, A.1
Cook2
-
11
-
-
0031539451
-
Estimations for the separation number of a polynomial system
-
MR1487794 99b:65065
-
J. P. Dedieu, Estimations for the separation number of a polynomial system, J. Symbolic Comput. 24 (1997), no. 6, 683-693. MR1487794 (99b:65065)
-
(1997)
J. Symbolic Comput
, vol.24
, Issue.6
, pp. 683-693
-
-
Dedieu, J.P.1
-
12
-
-
77950592622
-
-
Foundations of computational mathematics Oxford, 1999, London Math. Soc. Lecture Note Ser., Cambridge Univ. Press, Cambridge, MR1836614 2002d:65050
-
Newton's method and some complexity aspects of the zero-finding problem, Foundations of computational mathematics (Oxford, 1999), London Math. Soc. Lecture Note Ser., vol. 284, Cambridge Univ. Press, Cambridge, 2001, pp. 45-67. MR1836614 (2002d:65050)
-
(2001)
Newton's Method and Some Complexity Aspects of the Zero-finding Problem
, vol.284
, pp. 45-67
-
-
-
13
-
-
39749133077
-
-
Collection Mathématiques et Applications, Springer, to appear
-
Points fixes, zéros et la méthode de newton, Collection Mathématiques et Applications, Springer, to appear 2006.
-
(2006)
Points Fixes, Zéros et la Méthode de Newton
-
-
-
14
-
-
0004196298
-
-
Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, MR1789501 2001k:68036
-
Ding-Zhu Du and Ker-I Ko, Theory of computational complexity, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000. MR1789501 (2001k:68036)
-
(2000)
Theory of Computational Complexity
-
-
Du, D.-Z.1
Ko, K.-I.2
-
15
-
-
0000714249
-
The best bounds in Gautschi's inequality
-
MR1749300 2001g:33001
-
N. Elezović, C. Giordano, and J. Peçarić, The best bounds in Gautschi's inequality, Math. Inequal. Appl. 3 (2000), no. 2, 239-252. MR1749300 (2001g:33001)
-
(2000)
Math. Inequal. Appl.
, vol.3
, Issue.2
, pp. 239-252
-
-
Elezović, N.1
Giordano, C.2
Peçarić, J.3
-
16
-
-
0003372936
-
Geometric measure theory
-
Band, Springer-Verlag, New York, Inc., New York, MR0257325 41:1976
-
H. Federer, Geometric measure theory, Die Grundlehren der mathematischen Wissenschaften, Band 153, Springer-Verlag, New York, Inc., New York, 1969. MR0257325 (41:1976)
-
(1969)
Die Grundlehren Der Mathematischen Wissenschaften
, vol.153
-
-
Federer, H.1
-
17
-
-
84966206114
-
A note on proper maps
-
MR0370471 51:6698
-
Chung Wu Ho, A note on proper maps, Proc. Amer. Math. Soc. 51 (1975), 237-241. MR0370471 (51:6698)
-
(1975)
Proc. Amer. Math. Soc.
, vol.51
, pp. 237-241
-
-
Ho, C.W.1
-
18
-
-
84879422138
-
Analysis on homogeneous spaces
-
Spring, Royal Institute of Technology, Stocholm
-
R. Howard, Analysis on homogeneous spaces, Class notes, Spring 1994. Royal Institute of Technology, Stocholm.
-
(1994)
Class Notes
-
-
Howard, R.1
-
19
-
-
0035647444
-
How to find all roots of complex polynomials by Newton's method
-
DOI 10.1007/s002220100149
-
J. Hubbard, D. Schleicher, and S. Sutherland, How to find all roots of complex polynomials by Newton's method, Invent. Math. 146 (2001), no. 1, 1-33. MR1859017 (2002i:37059) (Pubitemid 33726297)
-
(2001)
Inventiones Mathematicae
, vol.146
, Issue.1
, pp. 1-33
-
-
Hubbard, J.1
Schleicher, D.2
Sutherland, S.3
-
21
-
-
38249005379
-
Topological complexity of a root finding algorithm
-
MR1018023 90m:65058
-
M. H. Kim, Topological complexity of a root finding algorithm, J. Complexity 5 (1989), no. 3, 331-344. MR1018023 (90m:65058)
-
(1989)
J. Complexity
, vol.5
, Issue.3
, pp. 331-344
-
-
Kim, M.H.1
-
22
-
-
0030497381
-
Hilbert's Nullstellensatz is in the polynomial hierarchy
-
Special issue for the Foundations of Computational Mathematics Conference Rio de Janeiro, MR1422712 98e:68109
-
P. Koiran, Hilbert's Nullstellensatz is in the polynomial hierarchy, J. Complexity 12 (1996), no. 4, 273-286, Special issue for the Foundations of Computational Mathematics Conference (Rio de Janeiro, 1997). MR1422712 (98e:68109)
-
(1996)
J. Complexity
, vol.12
, Issue.4
, pp. 273-286
-
-
Koiran, P.1
-
23
-
-
0028516907
-
On generalized Newton algorithms: Quadratic convergence, pathfollowing and error analysis
-
Selected papers of the Workshop on Continuous Algorithms and Complexity Barcelona, MR1294426 95g:65073
-
G. Malajovich, On generalized Newton algorithms: quadratic convergence, pathfollowing and error analysis, Theoret. Comput. Sci. 133 (1994), no. 1, 65-84, Selected papers of the Workshop on Continuous Algorithms and Complexity (Barcelona, 1993). MR1294426 (95g:65073)
-
(1993)
Theoret. Comput. Sci.
, vol.133
, Issue.1
, pp. 65-84
-
-
Malajovich, G.1
-
24
-
-
0017217375
-
Riemann's hypothesis and tests for primality
-
Working papers presented at the ACM-SIGACT Symposium on the Theory of Computing Albuquerque, N. M., MR0480295 58:470a
-
Gary L. Miller, Riemann's hypothesis and tests for primality, J. Comput. System Sci. 13 (1976), no. 3, 300-317, Working papers presented at the ACM-SIGACT Symposium on the Theory of Computing (Albuquerque, N. M., 1975). MR0480295 (58:470a)
-
(1975)
J. Comput. System Sci.
, vol.13
, Issue.3
, pp. 300-317
-
-
Miller, G.L.1
-
25
-
-
0041762768
-
On Kolmogorov complexity in the real Turing machine setting
-
MR1638154 99c:68134
-
J. L. Montaña and Luis M. Pardo, On Kolmogorov complexity in the real Turing machine setting, Inform. Process. Lett. 67 (1998), no. 2, 81-86. MR1638154 (99c:68134)
-
(1998)
Inform. Process. Lett
, vol.67
, Issue.2
, pp. 81-86
-
-
Montaña, J.L.1
Pardo, L.M.2
-
26
-
-
0344843865
-
Polynomial systems and the momentum map
-
Hong Kong, World Sci. Publishing, River Edge, NJ, 2002, MR2021984 2004k:65090
-
G. Malajovich and J. M. Rojas, Polynomial systems and the momentum map, Foundations of computational mathematics (Hong Kong, 2000), World Sci. Publishing, River Edge, NJ, 2002, pp. 251-266. MR2021984 (2004k:65090)
-
(2000)
Foundations of Computational Mathematics
, pp. 251-266
-
-
Malajovich, G.1
Rojas, J.M.2
-
27
-
-
33845432604
-
Probabilistic algorithm for testing primality
-
MR566880 81f:10003
-
M. O. Rabin, Probabilistic algorithm for testing primality, J. Number Theory 12 (1980), no. 1, 128-138. MR566880 (81f:10003)
-
(1980)
J. Number Theory
, vol.12
, Issue.1
, pp. 128-138
-
-
Rabin, M.O.1
-
28
-
-
0023292476
-
On the efficiency of Newton's method in approximating all zeros of a system of complex polynomials
-
MR882846 88j:65112
-
J. Renegar, On the efficiency of Newton's method in approximating all zeros of a system of complex polynomials, Math. Oper. Res. 12 (1987), no. 1, 121-148. MR882846 (88j:65112)
-
(1987)
Math. Oper. Res.
, vol.12
, Issue.1
, pp. 121-148
-
-
Renegar, J.1
-
29
-
-
0001861435
-
Some remarks on Bezout's theorem and complexity theory
-
Berkeley, CA, New York, Springer, 1993, MR1246139 95a:14002
-
M. Shub, Some remarks on Bezout's theorem and complexity theory, From Topology to Computation: Proceedings of the Smalefest (Berkeley, CA, 1990) (New York), Springer, 1993, pp. 443-455. MR1246139 (95a:14002)
-
(1990)
From Topology to Computation: Proceedings of the Smalefest
, pp. 443-455
-
-
Shub, M.1
-
30
-
-
62949144020
-
Complexity of Bezout's Theorem VI: Geodesics in the Condition (number) Metric
-
Online First 10.1007/s10208-007-9017-6
-
Complexity of Bezout's Theorem VI: Geodesics in the Condition (number) Metric, J. FoCM Online First 10.1007/s10208-007-9017-6 (2008).
-
(2008)
J. FoCM
-
-
-
31
-
-
0002383975
-
Newton's method estimates from data at one point
-
Laramie, Wyo., 1985, Springer, New York, MR870648 88e:65076
-
S. Smale, Newton's method estimates from data at one point, The merging of disciplines: new directions in pure, applied, and computational mathematics (Laramie, Wyo., 1985), Springer, New York, 1986, pp. 185-196. MR870648 (88e:65076)
-
(1986)
The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics
, pp. 185-196
-
-
Smale, S.1
-
32
-
-
0001873077
-
A fast Monte-Carlo test for primality
-
MR0429721 55:2732
-
R. Solovay and V. Strassen, A fast Monte-Carlo test for primality, SIAM J. Comput. 6 (1977), no. 1, 84-85. MR0429721 (55:2732)
-
(1977)
SIAM J. Comput
, vol.6
, Issue.1
, pp. 84-85
-
-
Solovay, R.1
Strassen, V.2
-
33
-
-
0001873077
-
Erratum: A fast Monte-Carlo test for primality
-
SIAM J. Comput. 6 1977, no. 1, 84-85, MR0466001 57:5885
-
Erratum: "A fast Monte-Carlo test for primality" (SIAM J. Comput. 6 (1977), no. 1, 84-85), SIAM J. Comput. 7 (1978), no. 1, 118. MR0466001 (57:5885)
-
(1978)
SIAM J. Comput.
, vol.7
, Issue.1
, pp. 118
-
-
-
34
-
-
84968505377
-
Complexity of Bezout's theorem. I. Geometric aspects
-
MR1175980 93k:65045
-
M. Shub and S. Smale, Complexity of Bezout's theorem. I. Geometric aspects, J. Amer. Math. Soc. 6 (1993), no. 2, 459-501. MR1175980 (93k:65045)
-
(1993)
J. Amer. Math. Soc.
, vol.6
, Issue.2
, pp. 459-501
-
-
Shub, M.1
Smale, S.2
-
35
-
-
0000537756
-
Complexity of bezout's theorem. II. Volumes and probabilities, computational algebraic geometry
-
Nice, 1992, Birkhäuser Boston, Boston, MA, MR1230872 94m:68086
-
Complexity of Bezout's theorem. II. Volumes and probabilities, Computational algebraic geometry (Nice, 1992), Progr. Math., vol. 109, Birkhäuser Boston, Boston, MA, 1993, pp. 267-285. MR1230872 (94m:68086)
-
(1993)
Progr. Math.
, vol.109
, pp. 267-285
-
-
-
36
-
-
0002102930
-
Complexity of Bezout's theorem. III. Condition number and packing
-
Festschrift for Joseph F. Traub, Part I. MR1213484 94g:65152
-
Complexity of Bezout's theorem. III. Condition number and packing, J. Complexity 9 (1993), no. 1, 4-14, Festschrift for Joseph F. Traub, Part I. MR1213484 (94g:65152)
-
(1993)
J. Complexity
, vol.9
, Issue.1
, pp. 4-14
-
-
-
37
-
-
0028516294
-
Complexity of Bezout's theorem. V. Polynomial time
-
Selected papers of the Workshop on Continuous Algorithms and Complexity Barcelona, 1993. MR1294430 96d:65091
-
Complexity of Bezout's theorem. V. Polynomial time, Theoret. Comput. Sci. 133 (1994), no. 1, 141-164, Selected papers of the Workshop on Continuous Algorithms and Complexity (Barcelona, 1993). MR1294430 (96d:65091)
-
(1994)
Theoret. Comput. Sci.
, vol.133
, Issue.1
, pp. 141-164
-
-
-
38
-
-
0000675799
-
Complexity of Bezout's theorem. IV. Probability of success; extensions
-
MR1377247 97k:65310
-
Complexity of Bezout's theorem. IV. Probability of success; extensions, SIAM J. Numer. Anal. 33 (1996), no. 1, 128-148. MR1377247 (97k:65310)
-
(1996)
SIAM J. Numer. Anal
, vol.33
, Issue.1
, pp. 128-148
-
-
-
39
-
-
33747920150
-
A universal constant for the convergence of Newton's method and an application to the classical homotopy method
-
MR1339720 96d:65092
-
J. C. Yakoubsohn, A universal constant for the convergence of Newton's method and an application to the classical homotopy method, Numer. Algorithms 9 (1995), no. 3-4, 223-244. MR1339720 (96d:65092)
-
(1995)
Numer. Algorithms
, vol.9
, Issue.3-4
, pp. 223-244
-
-
Yakoubsohn, J.C.1
|