Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Peter Bürgisser
Peter Buergisser
2010 – today
- 2013
[c18]Peter Bürgisser, Christian Ikenmeyer: Explicit lower bounds via geometric complexity theory. STOC 2013: 141-150- [i10]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran: Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports 3(1): 47-66 (2013)
- 2012
- [j25]Peter Bürgisser, Dennis Amelunxen: Robust smoothed analysis of a condition number for linear programming. Math. Program. 131(1-2): 221-251 (2012)
- [j24]Dennis Amelunxen, Peter Bürgisser: A Coordinate-Free Condition Number for Convex Programming. SIAM Journal on Optimization 22(3): 1029-1041 (2012)
- [c17]Peter Bürgisser: Prospects for Geometric Complexity Theory. IEEE Conference on Computational Complexity 2012: 235
- [i9]Peter Bürgisser, Christian Ikenmeyer: Explicit Lower Bounds via Geometric Complexity Theory. CoRR abs/1210.8368 (2012)
- 2011
- [j23]Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman: An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP. SIAM J. Comput. 40(4): 1179-1209 (2011)
- [c16]
- [c15]Peter Bürgisser, Christian Ikenmeyer: Geometric complexity theory and tensor rank. STOC 2011: 509-518
- 2010
- [j22]Peter Bürgisser, Peter Scheiblechner: Counting Irreducible Components of Complex Algebraic Varieties. Computational Complexity 19(1): 1-35 (2010)
- [j21]Peter Bürgisser, Felipe Cucker: Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Analysis Applications 31(5): 2769-2783 (2010)
- [c14]Peter Bürgisser, Felipe Cucker: Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. STOC 2010: 503-512
- [i8]Peter Buergisser, Christian Ikenmeyer: Geometric Complexity Theory and Tensor Rank. CoRR abs/1011.1350 (2010)
2000 – 2009
- 2009
- [j20]Peter Bürgisser: On Defining Integers And Proving Arithmetic Circuit Lower Bounds. Computational Complexity 18(1): 81-103 (2009)
- [j19]Peter Bürgisser, Felipe Cucker: Exotic Quantifiers, Complexity Classes, and Complete Problems. Foundations of Computational Mathematics 9(2): 135-170 (2009)
- [j18]Peter Bürgisser, Peter Scheiblechner: On the complexity of counting components of algebraic varieties. J. Symb. Comput. 44(9): 1114-1136 (2009)
- [j17]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)
- [i7]Peter Buergisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman: An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP. CoRR abs/0907.2850 (2009)
- 2008
- [j16]Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich: Guest Editor's Preface. J. Complexity 24(1): 2 (2008)
- [j15]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
- [j14]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)
- [c13]Peter Bürgisser, Felipe Cucker: Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP 2007: 207-218
- [c12]Peter Bürgisser, Peter Scheiblechner: Differential forms in computational algebraic geometry. ISSAC 2007: 61-68
- [c11]Peter Bürgisser: On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds. STACS 2007: 133-144
- 2006
- [j13]Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois: The complexity of semilinear problems in succinct representation. Computational Complexity 15(3): 197-235 (2006)
- [j12]Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complexity 22(2): 147-191 (2006)
- [c10]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
- [c9]Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis. Complexity of Boolean Functions 2006
- [i6]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)
- 2005
- [j11]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)
- [c8]Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois: The Complexity of Semilinear Problems in Succinct Representation. FCT 2005: 479-490
- [i5]Peter Bürgisser, Martin Lotz: The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties. CoRR abs/cs/0502044 (2005)
- [i4]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)
- [i3]Peter Bürgisser, Felipe Cucker: Exotic quantifiers, complexity classes, and complete problems. Electronic Colloquium on Computational Complexity (ECCC)(138) (2005)
- 2004
- [j10]Peter Bürgisser: The Complexity of Factors of Multivariate Polynomials. Foundations of Computational Mathematics 4(4): 369-396 (2004)
- [j9]Peter Bürgisser, Martin Lotz: Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM 51(3): 464-482 (2004)
- [c7]Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. STOC 2004: 475-485
- 2003
- [c6]Peter Bürgisser, Felipe Cucker: Counting Complexity Classes over the Reals I: The Additive Case. ISAAC 2003: 625-634
- [i2]Peter Bürgisser, Martin Lotz: Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. CoRR cs.CC/0301016 (2003)
- [i1]Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. CoRR cs.CC/0312007 (2003)
- 2002
- [c5]Peter Bürgisser, Martin Lotz: Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. FOCS 2002: 659-668
- 2001
- [c4]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
- [c3]
- [c2]Peter Bürgisser: On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. MFCS 2001: 3-17
- 2000
- [j8]Peter Bürgisser: The Computational Complexity to Evaluate Representations of General Linear Groups. SIAM J. Comput. 30(3): 1010-1022 (2000)
- [j7]
- [j6]
1990 – 1999
- 1999
- [j5]Peter Bürgisser: On the Structure of Valiant's Complexity Classes. Discrete Mathematics & Theoretical Computer Science 3(3): 73-94 (1999)
- 1998
- [j4]Peter Bürgisser: On the Parallel Complexity of the Polynomial Ideal Membership Problem. J. Complexity 14(2): 176-189 (1998)
- [c1]
- 1997
- [b1]Peter Bürgisser, Michael Clausen, Mohammad Amin Shokrollahi: Algebraic complexity theory. Grundlehren der mathematischen Wissenschaften 315, Springer 1997, ISBN 3-540-60582-7, pp. I-XXIII, 1-618
- 1993
- [j3]Peter Bürgisser, Marek Karpinski, Thomas Lickteig: On Randomized Semi-algebraic Test Complexity. J. Complexity 9(2): 231-251 (1993)
- 1992
- [j2]Peter Bürgisser, Thomas Lickteig, Michael Shub: Test complexity of generic polynomials. J. Complexity 8(3): 203-215 (1992)
- 1991
- [j1]Peter Bürgisser, Marek Karpinski, Thomas Lickteig: Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Computational Complexity 1: 131-155 (1991)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-13 23:03 CEST by the dblp team