Nonlinear Equations - UFRJ

BIBLIOGRAPHY 169
[55] Gregorio Malajovich, On the complexity of path-following Newton algorithms
for solving systems of polynomial equations with integer coefficients, PhD
Thesis, Department of Mathematics, University of California at Berkeley,
1993, http://www.labma.ufrj.br/~gregorio/papers/thesis.pdf.
[56] , On generalized Newton algorithms: quadratic convergence, pathfollowing
and error analysis, Theoret. Comput. Sci. 133 (1994), no. 1, 65–
84, DOI 10.1016/0304-3975(94)00065-4. Selected papers of the Workshop on
Continuous Algorithms and Complexity (Barcelona, 1993).
[57] Gregorio Malajovich and Klaus Meer, Computing minimal multihomogeneous
Bézout numbers is hard, Theory Comput. Syst. 40 (2007),
no. 4, 553–570, DOI 10.1007/s00224-006-1322-y.
[58] Gregorio Malajovich and J. Maurice Rojas, High probability analysis of the
condition number of sparse polynomial systems, Theoret. Comput. Sci. 315
(2004), no. 2-3, 524–555, DOI 10.1016/j.tcs.2004.01.006.
[59] , Polynomial systems and the momentum map, Foundations of computational
mathematics (Hong Kong, 2000), World Sci. Publ., River Edge,
NJ, 2002, pp. 251–266.
[60] Maxima.sourceforge.net, Maxima, a Computer Algebra System, Version
5.18.1, 2009.
[61] John W. Milnor, Topology from the differentiable viewpoint, Princeton Landmarks
in Mathematics, Princeton University Press, Princeton, NJ, 1997.
Based on notes by David W. Weaver; Revised reprint of the 1965 original.
[62] Ferdinand Minding, On the determination of the degree of an equation obtained
by elimination, Topics in algebraic geometry and geometric modeling,
Contemp. Math., vol. 334, Amer. Math. Soc., Providence, RI, 2003, pp. 351–
362. Translated from the German (Crelle, 1841)and with a commentary by
D. Cox and J. M. Rojas.
[63] Ketan D. Mulmuley and Milind Sohoni, Geometric complexity theory: introduction,
Technical Report TR-2007-16, Department of Computer Science,
University of Chicago, September 4, 2007, http://www.cs.uchicago.edu/
research/publications/techreports/TR-2007-16.
[64] Kazuo Muroi, Reexamination of the Susa mathematical text no. 12: a system
of quartic equations, SCIAMVS 2 (2001), 3–8.
[65] Leopoldo Nachbin, Lectures on the Theory of Distributions, Textos de
Matemática, Instituto de Física e Matemática, Universidade do Recife, 1964.
[66] , Topology on spaces of holomorphic mappings, Ergebnisse der Mathematik
und ihrer Grenzgebiete, Band 47, Springer-Verlag New York Inc.,
New York, 1969.
[67] James Renegar, On the worst-case arithmetic complexity of approximating
zeros of systems of polynomials, SIAM J. Comput. 18 (1989), no. 2, 350–370,
DOI 10.1137/0218024.
[68] Michael Shub, Some remarks on Bezout’s theorem and complexity theory,
From Topology to Computation: Proceedings of the Smalefest (Berkeley,
CA, 1990), Springer, New York, 1993, pp. 443–455.