 | 2010 |
|---|
| 8 |       | Felipe Cucker,
Raphael Hauser,
Martin Lotz:
Adversarial smoothed analysis.
J. Complexity 26(3): 255-262 (2010) |
| 2008 |
|---|
| 7 | | Peter Bürgisser,
Felipe Cucker,
Martin Lotz:
The probability that a slightly perturbed numerical analysis problem is difficult.
Math. Comput. 77(263): 1559-1583 (2008) |
| 2007 |
|---|
| 6 | | Peter Bürgisser,
Martin Lotz:
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties.
Foundations of Computational Mathematics 7(1): 59-86 (2007) |
| 2005 |
|---|
| 5 | | Peter Bürgisser,
Martin Lotz:
The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
CoRR abs/cs/0502044: (2005) |
| 4 | | Peter Bürgisser,
Felipe Cucker,
Martin Lotz:
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets.
Foundations of Computational Mathematics 5(4): 351-387 (2005) |
| 2004 |
|---|
| 3 | | Peter Bürgisser,
Martin Lotz:
Lower bounds on the bounded coefficient complexity of bilinear maps.
J. ACM 51(3): 464-482 (2004) |
| 2003 |
|---|
| 2 | | Peter Bürgisser,
Martin Lotz:
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps
CoRR cs.CC/0301016: (2003) |
| 2002 |
|---|
| 1 | | Peter Bürgisser,
Martin Lotz:
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps.
FOCS 2002: 659-668 |
Data released under the ODC-BY 1.0 license — See also our legal information page