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