The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gregorio Malajovich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Klaus Meer, Gregorio Malajovich
    On the Complexity of Computing Multi-Homogeneous Bézout Numbers. [Citation Graph (0, 0)][DBLP]
    Algorithms and Complexity for Continuous Problems, 2004, pp:- [Conf]
  2. Gregorio Malajovich, Klaus Meer
    Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:244-255 [Conf]
  3. Gregorio Malajovich, Klaus Meer
    Computing Multi-Homogeneous Bezout Numbers is Hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  4. Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub
    On the Curvature of the Central Path of Linear Programming Theory. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2005, v:5, n:2, pp:145-171 [Journal]
  5. James Demmel, B. Diament, Gregorio Malajovich
    On the Complexity of Computing Error Bounds. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2001, v:1, n:1, pp:101-125 [Journal]
  6. Askold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub
    Guest editors' preface. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:1, pp:4-0 [Journal]
  7. Gregorio Malajovich
    Condition Number Bounds for Problems with Integer Coefficients. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:3, pp:529-551 [Journal]
  8. Gregorio Malajovich
    On a Transfer Theorem for the P != NP Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2001, v:17, n:1, pp:27-85 [Journal]
  9. Gregorio Malajovich, Jorge P. Zubelli
    On the Geometry of Graeffe Iteration. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2001, v:17, n:3, pp:541-573 [Journal]
  10. Gregorio Malajovich, Klaus Meer
    On the Structure of NP_C. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:27-35 [Journal]
  11. Gregorio Malajovich
    Lower bounds for some decision problems over C. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:425-434 [Journal]
  12. Gregorio Malajovich
    On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:1, pp:65-84 [Journal]
  13. Gregorio Malajovich, Maurice Rojas
    High probability analysis of the condition number of sparse polynomial systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:315, n:2-3, pp:525-555 [Journal]
  14. Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor
    A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  15. Gregorio Malajovich, Klaus Meer
    Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:553-570 [Journal]

  16. A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis [Citation Graph (, )][DBLP]


  17. A Numerical Algorithm for Zero Counting. III: Randomization and Condition [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002