| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Peter Bürgisser, Dennis Amelunxen |
Robust smoothed analysis of a condition number for linear programming.  |
Math. Program.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
Probabilistic analysis of condition numbers. |
ISSAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Christian Ikenmeyer |
Geometric complexity theory and tensor rank. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Buergisser, Christian Ikenmeyer |
Geometric Complexity Theory and Tensor Rank |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser, Peter Scheiblechner |
Counting Irreducible Components of Complex Algebraic Varieties. |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker |
Smoothed Analysis of Moore-Penrose Inversion. |
SIAM J. Matrix Analysis Applications |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker |
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
approximate zero, polynomial equation solving, complexity, polynomial time, smoothed analysis, homotopy methods |
| 1 | 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 |
2009 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker |
Exotic Quantifiers, Complexity Classes, and Complete Problems. |
Foundations of Computational Mathematics |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 68Q17 |
| 1 | Peter Bürgisser, Peter Scheiblechner |
On the complexity of counting components of algebraic varieties. |
J. Symb. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
On Defining Integers And Proving Arithmetic Circuit Lower Bounds. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
Primary 68Q17, Secondary 11D45, Subject classification |
| 1 | Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen |
On the Complexity of Numerical Analysis. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich |
Guest Editor's Preface. |
J. Complexity |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker, Martin Lotz |
The probability that a slightly perturbed numerical analysis problem is difficult. |
Math. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Martin Lotz |
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties. |
Foundations of Computational Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker |
Exotic Quantifiers, Complexity Classes, and Complete Problems. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Peter Scheiblechner |
Differential forms in computational algebraic geometry. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
differential forms, irreducible components, complexity, connected components |
| 1 | Peter Bürgisser |
On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker |
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. |
J. Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois |
The complexity of semilinear problems in succinct representation. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q15 |
| 1 | Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen |
On the Complexity of Numerical Analysis. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen |
On the Complexity of Numerical Analysis. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker, Martin Lotz |
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. |
Foundations of Computational Mathematics |
2005 |
DBLP DOI BibTeX RDF |
Complexity classes, Counting problems, Euler characteristic |
| 1 | Peter Bürgisser, Felipe Cucker |
Exotic quantifiers, complexity classes, and complete problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen |
On the Complexity of Numerical Analysis |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser, Martin Lotz |
The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois |
The Complexity of Semilinear Problems in Succinct Representation. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
The Complexity of Factors of Multivariate Polynomials. |
Foundations of Computational Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Martin Lotz |
Lower bounds on the bounded coefficient complexity of bilinear maps. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
bilinear circuits, lower bounds, Algebraic complexity, singular values |
| 1 | Peter Bürgisser, Felipe Cucker |
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
counting complexity classes, geometric degree, semialgebraic sets, completeness, Betti numbers, Euler characteristic |
| 1 | Peter Bürgisser, Felipe Cucker |
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser, Martin Lotz |
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser, Felipe Cucker |
Counting Complexity Classes over the Reals I: The Additive Case. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Martin Lotz |
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
Lower Bounds and Real Algebraic Geometry. |
Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science |
2001 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser |
The Complexity of Factors of Multivariate Polynomials. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
Cook's versus Valiant's hypothesis. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
The Computational Complexity to Evaluate Representations of General Linear Groups. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
The Computational Complexity of Immanants. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
On the Structure of Valiant's Complexity Classes. |
Discrete Mathematics & Theoretical Computer Science |
1999 |
DBLP BibTeX RDF |
|
| 1 | Peter Bürgisser |
On the Parallel Complexity of the Polynomial Ideal Membership Problem. |
J. Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
On the Structure of Valiant's Complexity Classes. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Marek Karpinski, Thomas Lickteig |
On Randomized Semi-algebraic Test Complexity. |
J. Complexity |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Thomas Lickteig, Michael Shub |
Test complexity of generic polynomials. |
J. Complexity |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, Marek Karpinski, Thomas Lickteig |
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. |
Computational Complexity |
1991 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")