Peter Bürgisser

Peter Buergisser

	2012
48		Peter Bürgisser, Dennis Amelunxen: Robust smoothed analysis of a condition number for linear programming. Math. Program. 131(1-2): 221-251 (2012)
	2011
47		Peter Bürgisser: Probabilistic analysis of condition numbers. ISSAC 2011: 5-6
46		Peter Bürgisser, Christian Ikenmeyer: Geometric complexity theory and tensor rank. STOC 2011: 509-518
45		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)
	2010
44		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
43		Peter Buergisser, Christian Ikenmeyer: Geometric Complexity Theory and Tensor Rank CoRR abs/1011.1350: (2010)
42		Peter Bürgisser, Peter Scheiblechner: Counting Irreducible Components of Complex Algebraic Varieties. Computational Complexity 19(1): 1-35 (2010)
41		Peter Bürgisser, Felipe Cucker: Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Analysis Applications 31(5): 2769-2783 (2010)
	2009
40		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)
39		Peter Bürgisser: On Defining Integers And Proving Arithmetic Circuit Lower Bounds. Computational Complexity 18(1): 81-103 (2009)
38		Peter Bürgisser, Felipe Cucker: Exotic Quantifiers, Complexity Classes, and Complete Problems. Foundations of Computational Mathematics 9(2): 135-170 (2009)
37		Peter Bürgisser, Peter Scheiblechner: On the complexity of counting components of algebraic varieties. J. Symb. Comput. 44(9): 1114-1136 (2009)
36		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
35		Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich: Guest Editor's Preface. J. Complexity 24(1): 2 (2008)
34		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
33		Peter Bürgisser, Felipe Cucker: Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP 2007: 207-218
32		Peter Bürgisser, Peter Scheiblechner: Differential forms in computational algebraic geometry. ISSAC 2007: 61-68
31		Peter Bürgisser: On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds. STACS 2007: 133-144
30		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		Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis. Complexity of Boolean Functions 2006
28		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		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		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		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		Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois: The Complexity of Semilinear Problems in Succinct Representation. FCT 2005: 479-490
23		Peter Bürgisser, Martin Lotz: The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties CoRR abs/cs/0502044: (2005)
22		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		Peter Bürgisser, Felipe Cucker: Exotic quantifiers, complexity classes, and complete problems Electronic Colloquium on Computational Complexity (ECCC)(138): (2005)
20		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		Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. STOC 2004: 475-485
18		Peter Bürgisser: The Complexity of Factors of Multivariate Polynomials. Foundations of Computational Mathematics 4(4): 369-396 (2004)
17		Peter Bürgisser, Martin Lotz: Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM 51(3): 464-482 (2004)
	2003
16		Peter Bürgisser, Felipe Cucker: Counting Complexity Classes over the Reals I: The Additive Case. ISAAC 2003: 625-634
15		Peter Bürgisser, Martin Lotz: Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps CoRR cs.CC/0301016: (2003)
14		Peter Bürgisser, Felipe Cucker: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets CoRR cs.CC/0312007: (2003)
	2002
13		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		Peter Bürgisser: On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. MFCS 2001: 3-17
	2000
9		Peter Bürgisser: The Computational Complexity to Evaluate Representations of General Linear Groups. SIAM J. Comput. 30(3): 1010-1022 (2000)
8		Peter Bürgisser: The Computational Complexity of Immanants. SIAM J. Comput. 30(3): 1023-1040 (2000)
7		Peter Bürgisser: Cook's versus Valiant's hypothesis. Theor. Comput. Sci. 235(1): 71-88 (2000)
	1999
6		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		Peter Bürgisser: On the Parallel Complexity of the Polynomial Ideal Membership Problem. J. Complexity 14(2): 176-189 (1998)
	1993
3		Peter Bürgisser, Marek Karpinski, Thomas Lickteig: On Randomized Semi-algebraic Test Complexity. J. Complexity 9(2): 231-251 (1993)
	1992
2		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)

Coauthor Index

1	Eric Allender	[22] [28] [29] [36]
2	Dennis Amelunxen	[48]
3	Felipe Cucker	[14] [16] [19] [20] [21] [24] [25] [27] [33] [34] [38] [41] [44]
4	Andrei Gabrielov	[35]
5	Christian Ikenmeyer	[43] [46]
6	Marek Karpinski	[1] [3]
7	Johan Kjeldgaard-Pedersen	[22] [28] [29] [36]
8	Teresa Krick	[35]
9	J. M. Landsberg	[40] [45]
10	Thomas Lickteig	[1] [2] [3]
11	Martin Lotz	[13] [15] [17] [20] [23] [30] [34]
12	Gregorio Malajovich	[35]
13	Laurent Manivel	[40] [45]
14	Peter Bro Miltersen	[22] [28] [29] [36]
15	Paulin Jacobé de Naurois	[24] [27]
16	Peter Scheiblechner	[32] [37] [42]
17	Mike Shub (Michael Shub)	[2]
18	Jerzy Weyman	[40] [45]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page