| 2009 |
|---|
| 35 | EE | Eric Allender,
Peter Bürgisser,
Johan Kjeldgaard-Pedersen,
Peter Bro Miltersen:
On the Complexity of Numerical Analysis.
SIAM J. Comput. 38(5): 1987-2006 (2009) |
| 2008 |
|---|
| 34 | EE | Peter Bürgisser,
Andrei Gabrielov,
Teresa Krick,
Gregorio Malajovich:
Guest Editor's Preface.
J. Complexity 24(1): 2 (2008) |
| 2007 |
|---|
| 33 | EE | Peter Bürgisser,
Felipe Cucker:
Exotic Quantifiers, Complexity Classes, and Complete Problems.
ICALP 2007: 207-218 |
| 32 | EE | Peter Bürgisser,
Peter Scheiblechner:
Differential forms in computational algebraic geometry.
ISSAC 2007: 61-68 |
| 31 | EE | Peter Bürgisser:
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds.
STACS 2007: 133-144 |
| 30 | EE | 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) |
| 2006 |
|---|
| 29 | EE | Eric Allender,
Peter Bürgisser,
Johan Kjeldgaard-Pedersen,
Peter Bro Miltersen:
On the Complexity of Numerical Analysis.
Complexity of Boolean Functions 2006 |
| 28 | EE | Eric Allender,
Peter Bürgisser,
Johan Kjeldgaard-Pedersen,
Peter Bro Miltersen:
On the Complexity of Numerical Analysis.
IEEE Conference on Computational Complexity 2006: 331-339 |
| 27 | EE | Peter Bürgisser,
Felipe Cucker,
Paulin Jacobé de Naurois:
The complexity of semilinear problems in succinct representation.
Computational Complexity 15(3): 197-235 (2006) |
| 26 | EE | Peter Bürgisser:
On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity.
Electronic Colloquium on Computational Complexity (ECCC) 13(113): (2006) |
| 25 | EE | Peter Bürgisser,
Felipe Cucker:
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets.
J. Complexity 22(2): 147-191 (2006) |
| 2005 |
|---|
| 24 | EE | Peter Bürgisser,
Felipe Cucker,
Paulin Jacobé de Naurois:
The Complexity of Semilinear Problems in Succinct Representation.
FCT 2005: 479-490 |
| 23 | EE | Peter Bürgisser,
Martin Lotz:
The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
CoRR abs/cs/0502044: (2005) |
| 22 | EE | Eric Allender,
Peter Bürgisser,
Johan Kjeldgaard-Pedersen,
Peter Bro Miltersen:
On the Complexity of Numerical Analysis
Electronic Colloquium on Computational Complexity (ECCC)(037): (2005) |
| 21 | EE | Peter Bürgisser,
Felipe Cucker:
Exotic quantifiers, complexity classes, and complete problems
Electronic Colloquium on Computational Complexity (ECCC)(138): (2005) |
| 20 | EE | 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 |
|---|
| 19 | EE | Peter Bürgisser,
Felipe Cucker:
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets.
STOC 2004: 475-485 |
| 18 | EE | Peter Bürgisser:
The Complexity of Factors of Multivariate Polynomials.
Foundations of Computational Mathematics 4(4): 369-396 (2004) |
| 17 | EE | Peter Bürgisser,
Martin Lotz:
Lower bounds on the bounded coefficient complexity of bilinear maps.
J. ACM 51(3): 464-482 (2004) |
| 2003 |
|---|
| 16 | EE | Peter Bürgisser,
Felipe Cucker:
Counting Complexity Classes over the Reals I: The Additive Case.
ISAAC 2003: 625-634 |
| 15 | EE | Peter Bürgisser,
Martin Lotz:
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps
CoRR cs.CC/0301016: (2003) |
| 14 | EE | Peter Bürgisser,
Felipe Cucker:
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
CoRR cs.CC/0312007: (2003) |
| 2002 |
|---|
| 13 | EE | Peter Bürgisser,
Martin Lotz:
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps.
FOCS 2002: 659-668 |
| 2001 |
|---|
| 12 | | Peter Bürgisser:
Lower Bounds and Real Algebraic Geometry.
Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science 2001: 35-54 |
| 11 | | Peter Bürgisser:
The Complexity of Factors of Multivariate Polynomials.
FOCS 2001: 378-385 |
| 10 | EE | Peter Bürgisser:
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.
MFCS 2001: 3-17 |
| 2000 |
|---|
| 9 | EE | Peter Bürgisser:
The Computational Complexity to Evaluate Representations of General Linear Groups.
SIAM J. Comput. 30(3): 1010-1022 (2000) |
| 8 | EE | Peter Bürgisser:
The Computational Complexity of Immanants.
SIAM J. Comput. 30(3): 1023-1040 (2000) |
| 7 | EE | Peter Bürgisser:
Cook's versus Valiant's hypothesis.
Theor. Comput. Sci. 235(1): 71-88 (2000) |
| 1999 |
|---|
| 6 | EE | Peter Bürgisser:
On the Structure of Valiant's Complexity Classes.
Discrete Mathematics & Theoretical Computer Science 3(3): 73-94 (1999) |
| 1998 |
|---|
| 5 | | Peter Bürgisser:
On the Structure of Valiant's Complexity Classes.
STACS 1998: 194-204 |
| 4 | EE | Peter Bürgisser:
On the Parallel Complexity of the Polynomial Ideal Membership Problem.
J. Complexity 14(2): 176-189 (1998) |
| 1993 |
|---|
| 3 | EE | Peter Bürgisser,
Marek Karpinski,
Thomas Lickteig:
On Randomized Semi-algebraic Test Complexity.
J. Complexity 9(2): 231-251 (1993) |
| 1992 |
|---|
| 2 | EE | Peter Bürgisser,
Thomas Lickteig,
Michael Shub:
Test complexity of generic polynomials.
J. Complexity 8(3): 203-215 (1992) |
| 1991 |
|---|
| 1 | | Peter Bürgisser,
Marek Karpinski,
Thomas Lickteig:
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
Computational Complexity 1: 131-155 (1991) |
