| Searching for (malajovich gregorio) or (malajovich g). |
71 citations found. Retrieving citations...
Context Doc 6 (2): G. Malajovich, On generalized Newton algorithms : quadratic convergence, path-following and error analysis, Theoretical Computer Science 133 (1994), 65-84
Context Doc 3 (0): Jean-Pierre Dedieu, Pierre Priouret, and Gregorio Malajovich, Newton's method on Riemannian manifolds: convariant alpha theory, IMA J. Numer. Anal. 23 (2003), no. 3, 395--419. MR 2004e:65061
Context Doc 3 (1): G. Malajovich, K. Meer, On the structure of NP 0 C , preprint 1995
Context Doc 2 (1): Malajovich, Gregorio, \Condition Number Bounds for Problems with Integer Coe- cients," Journal of Complexity, to appear september 2000.
Context Doc 2 (0): Gregorio Malajovich On generalized Newton algorithms : quadratic convergence, path-following and error analysis. Theoretical Computer Science 133 65-84, 1994.
Context Doc 1 (0): J. Demmel, B. Diament and G. Malajovich, "On the Complexity of Computing Error Bounds," Foundations of Computation Math., 1 (2001), pp. 101--125.
Context Doc 1 (0): G. Malajovich, K. Meer : On the Structure of NP C . Preprint 1995, submitted
Context Doc 1 (0): J-P. DEDIEU, G. MALAJOVICH, and M. SHUB. On the curvature of the central path of linear programming theory. Technical report, Universite paul Sabatier, Toulouse, France, 2003.
Context Doc 1 (0): G. Malajovich. pss 2.alpha, polynomial system solver, version 2.alpha. README file, distributed by the author through gopher.
Context Doc 1 (0): G. Malajovich. An effective version of Kronecker's theorem on simultaneous Diophantine approximation. Technical report, City University of Hong Kong, 1996.
Context Doc 1 (0): Lenore Blum, Felipe Cucker, Mike Shub, and Steve Smale. Algebraic settings for the problem P 6= NP. In Steve Smale James Renegar, Michael Shub, editor, The Mathematics of Numerical Analysis, volume 32 of Lectures in Applied Mathematics, pages 125-144. American Mathematical Society, 1996. 38 GREGORIO MALAJOVICH
Context Doc 1 (2): Gregorio Malajovich On the complexity of path-following Newton algorithms for solving systems of polynomial equations with integer coeÆcients. PhD Thesis, Berkeley, 1993. United Microlms Inc, 300 North Zeeb Road, Ann Arbor, MI, 48106-1346 USA, Phone 800-521-0600.
Context Doc 1 (0): Victor Y. Pan, Deterministic Improvement of Complex Polynomial Factorization Based on the Properties of the Associated Resultant. Computers Math. Applic., 30 (2), 71-94 (1995). 36 GREGORIO MALAJOVICH AND JORGE P. ZUBELLI
Context Doc 1 (0): G. Malajovich. pss 2 -- Polynomial System Solver. Available at http://www.labma.ufrj.br:80/~gregorio.
Context Doc 1 (0): Malajovich, G., Computability in Dynamical Systems, preprint.
Context Doc 1 (0): G. Malajovich. Unitary invariance of the kostlan norm (linear algebra proof). 1994. Unpublished.
Context Doc 1 (1): G. Malajovich. On the Complexity of Path-Following Newton Algorithms for Solving Systems of Polynomial Equations with Integer Coeficients. PhD thesis, University of California at Berkeley, U.S.A., 1993.
Context Doc 1 (0): G. Malajovich. Worst possible condition number of polynomial systems. preprint 17 pages, 1995.
Context Doc 0 (2): G. Malajovich, K. Meer, On the Structure of NPC , to appear in: SIAM Journal on Computing.
Context Doc 0 (1): Gregorio Malajovich and Jorge Zubelli, Tangent grae e iteration, Numerische Mathematik 89 (2001), 749-782.
Context Doc 0 (1): Gregorio Malajovich and Jorge Zubelli, On the geometry of grae e iteration, Journal of Complexity 17 (2001), no. 3, 541-573.
Context Doc 0 (2): Gregorio Malajovich and J. Maurice Rojas, Random sparse polynomial systems, 2000, Preprint.
Context Doc 0 (2): Gregorio Malajovich and J. Maurice Rojas, Polynomial systems and the momentum map,
Context Doc 0 (2): Gregorio Malajovich, Covariant -theory, toric manifolds and the numerical solution of polynomial systems, 2001, Preprint.
Context Doc 0 (1): Jean-Pierre Dedieu, Pierre Priouret, and Gregorio Malajovich, Newton method on riemannian manifolds: Covariant alpha-theory, Preprint.
Context Doc 0 (1): Malajovich, G., On Generalized Newton Algorithms, Theoretical Computer Science, (1994), vol. 133, pp.65-84. 27
Context Doc 0 (3): Gregorio Malajovich. On a transfer theorem for the P 6= NP conjecture,
Context Doc 0 (3): Gregorio Malajovich and Jorge P. Zubelli. A Fast and Stable Algorithm for Splitting Polynomials. Computers and Mathematics with Applications, 33:3, 1-23, 1997.
Context Doc 0 (3): G. Malajovich and J. P. Zubelli, On the geometry of Grae e iteration, 1997. Informes de Matematica Serie B-118, IMPA.
Context Doc 0 (1): Gregorio Malajovich Worst possible condition number of polynomial systems. Preprint, Rio de Janeiro, 1995.
Context Doc 0 (2): Gregorio Malajovich and Jorge Zubelli, Tangent grae e iteration, Numerische Mathematik (To appear).
Context Doc 0 (3): Gregorio Malajovich and Klaus Meer. On the structure of NP C . SIAM Journal on Computing, 28(1), 1999.
Context Doc 0 (2): Gregorio Malajovich. Lower bounds for some decision problems over C . Preprint, MSRI, 1999.
Context Doc 0 (2): Gregorio Malajovich and Jorge Zubelli, On the geometry of grae e iteration, Journal of Complexity (To appear).
Context Doc 0 (2): Gregorio Malajovich On the complexity of path-following Newton algorithms for solving systems of polynomial equations with integer coefficients. PhD Thesis, Berkeley, 1993. United Microfilms Inc, 300 North Zeeb Road, Ann Arbor, MI, 48106-1346 USA, Phone 800-521-0600.
Context Doc 0 (2): Gregorio Malajovich and Jorge P. Zubelli. Tangent Graeffe iteration, 1998. Informes de Matem'atica S'erie B-119, IMPA.
The numbers before each article are the number of citations (excluding self-citations), and the predicted number of self-citations. 71 citations were found, of which 42 were predicted to be self-citations. Self-citations are not included in the graph.
Try your query at: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC