Peter Bürgisser

发表

On Defining Integers And Proving Arithmetic Circuit Lower Bounds

Peter Bürgisser, 2009, computational complexity.

Lower bounds on the bounded coefficient complexity of bilinear maps

Peter Bürgisser, Martin Lotz, Martin Lotz, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Counting complexity classes for numeric computations II: algebraic and semialgebraic sets

Felipe Cucker, Peter Bürgisser, F. Cucker, 2003, STOC '04.

On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds

Peter Bürgisser, 2007, STACS.

Separation Results and Future Directions

Peter Bürgisser, 2000 .

On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity

Peter Bürgisser, Peter Bürgisser, 2001, MFCS.

Robust smoothed analysis of a condition number for linear programming

Peter Bürgisser, Dennis Amelunxen, 2012, Math. Program..

On the Complexity of Numerical Analysis

Peter Bro Miltersen, Eric Allender, Peter Bürgisser, 2009, SIAM J. Comput..

Some computational problems in linear algebra as hard as matrix multiplication

Marek Karpinski, Thomas Lickteig, Peter Bürgisser, 2005, computational complexity.

Completeness and Reduction in Algebraic Complexity Theory

Peter Bürgisser, Peter Bürgisser, 2000, Algorithms and computation in mathematics.

Differential forms in computational algebraic geometry

Peter Scheiblechner, Peter Bürgisser, Peter Bürgisser, 2007, ISSAC '07.

Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem

Felipe Cucker, Peter Bürgisser, 2010, STOC '10.

On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity

Peter Bürgisser, 2006, Electron. Colloquium Comput. Complex..

The Complexity of Factors of Multivariate Polynomials

Peter Bürgisser, 2001, FOCS.

Exotic Quantifiers, Complexity Classes, and Complete Problems

Felipe Cucker, Peter Bürgisser, 2007, ICALP.

The Complexity of Semilinear Problems in Succinct Representation

Felipe Cucker, Peter Bürgisser, Paulin Jacobé de Naurois, 2005, FCT.

Membership in Moment Polytopes is in NP and coNP pdf

Michael Walter, Ketan Mulmuley, Matthias Christandl, 2015, SIAM J. Comput..

Models of Computation

Michael Clausen, Peter Bürgisser, Mohammad Amin Shokrollahi, 1997 .

Algebraic complexity theory

Michael Clausen, Peter Bürgisser, Amin Shokrollahi, 1997, Grundlehren der mathematischen Wissenschaften.

Intrinsic volumes of symmetric cones and applications in convex programming

Peter Bürgisser, Dennis Amelunxen, Dennis Amelunxen, 2015, Math. Program..

A Condition Number for Polyhedral Conic Systems

Felipe Cucker, Peter Bürgisser, 2013 .

Test complexity of generic polynomials

Thomas Lickteig, Michael Shub, Peter Bürgisser, 1992, J. Complex..

Probabilistic Analysis of Conic Condition Numbers: II. The Real Case

Felipe Cucker, Peter Bürgisser, 2013 .

Probabilistic analysis of condition numbers

Peter Bürgisser, 2011, ISSAC '11.

Fundamental invariants of orbit closures pdf

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2015, ArXiv.

Lower Bounds and Real Algebraic Geometry

Peter Bürgisser, 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

10481 Executive Summary - Computational Counting

Leslie Ann Goldberg, Mark Jerrum, Peter Bürgisser, 2010, Computational Counting.

Deciding Positivity of Littlewood-Richardson Coefficients

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2012, SIAM J. Discret. Math..

Explicit lower bounds via geometric complexity theory pdf

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2012, STOC '13.

Permanent versus determinant, obstructions, and Kronecker coefficients pdf

Peter Bürgisser, Peter Bürgisser, 2015, ArXiv.

A Coordinate-Free Condition Number for Convex Programming

Peter Bürgisser, Dennis Amelunxen, Dennis Amelunxen, 2011, SIAM J. Optim..

10481 Abstracts Collection - Computational Counting

Leslie Ann Goldberg, Mark Jerrum, Peter Bürgisser, 2010, Computational Counting.

Prospects for Geometric Complexity Theory

Peter Bürgisser, Peter Bürgisser, 2012, 2012 IEEE 27th Conference on Computational Complexity.

Counting Complexity Classes over the Reals I: The Additive Case

Felipe Cucker, Peter Bürgisser, F. Cucker, 2003, ISAAC.

Computing the Chow Variety of Quadratic Space Curves pdf

Bernd Sturmfels, Peter Bürgisser, Pierre Lairez, 2015, MACIS.

The Computational Complexity to Evaluate Representations of General Linear Groups

Peter Bürgisser, Peter Bürgisser, 2000, SIAM J. Comput..

Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)

Marek Karpinski, Felipe Cucker, Peter Bürgisser, 2015, Dagstuhl Reports.

The Linear Programming Feasibility Problem

Felipe Cucker, Peter Bürgisser, 2013 .

Guest Editor's Preface

Peter Bürgisser, Teresa Krick, Gregorio Malajovich, 2008, J. Complex..

On the Parallel Complexity of the Polynomial Ideal Membership Problem

Peter Bürgisser, Peter Bürgisser, 1998, J. Complex..

The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties

Peter Bürgisser, Martin Lotz, Martin Lotz, 2005, Found. Comput. Math..

No Occurrence Obstructions in Geometric Complexity Theory

Greta Panova, Peter Bürgisser, Christian Ikenmeyer, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets

Felipe Cucker, Peter Bürgisser, Martin Lotz, 2005, Found. Comput. Math..

The Complexity of Factors of Multivariate Polynomials

Peter Bürgisser, Peter Bürgisser, 2001, Found. Comput. Math..

Smoothed Analysis of Moore-Penrose Inversion

Felipe Cucker, Peter Bürgisser, F. Cucker, 2010, SIAM J. Matrix Anal. Appl..

On the condition of the zeros of characteristic polynomials

Felipe Cucker, Peter Bürgisser, Elisa Rocha Cardozo, 2017, J. Complex..

Condition - The Geometry of Numerical Algorithms

Felipe Cucker, Peter Bürgisser, F. Cucker, 2013, Grundlehren der mathematischen Wissenschaften.

Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes

Avi Wigderson, Ankit Garg, Michael Walter, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets

Felipe Cucker, Peter Bürgisser, 2006, J. Complex..

On the Structure of Valiant's Complexity Classes

Peter Bürgisser, Peter Bürgisser, 1998, Discret. Math. Theor. Comput. Sci..

Condition Length and Complexity for the Solution of Polynomial Systems

Felipe Cucker, Michael Shub, Peter Bürgisser, 2015, Found. Comput. Math..

Probabilistic Analysis of the Grassmann Condition Number

Peter Bürgisser, Dennis Amelunxen, Dennis Amelunxen, 2011, Found. Comput. Math..

Exotic Quantifiers, Complexity Classes, and Complete Problems

Felipe Cucker, Peter Bürgisser, F. Cucker, 2007, ICALP.

Lower bounds on the bounded coefficient complexity of bilinear maps

Peter Bürgisser, Martin Lotz, 2004, JACM.

An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP pdf

J. M. Landsberg, Peter Bürgisser, Laurent Manivel, 2009, SIAM J. Comput..

Computational Counting (Dagstuhl Seminar 13031)

Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran, 2013, Dagstuhl Reports.

Computing the Homology of Semialgebraic Sets. II: General Formulas

Felipe Cucker, Peter Bürgisser, Josué Tonelli-Cueto, 2019, Foundations of Computational Mathematics.

Computing the Homology of Semialgebraic Sets. I: Lax Formulas

Felipe Cucker, Peter Bürgisser, Josué Tonelli-Cueto, 2018, Foundations of Computational Mathematics.

The complexity of semilinear problems in succinct representation

Felipe Cucker, Peter Bürgisser, Paulin Jacobé de Naurois, 2005, computational complexity.

On the complexity of counting components of algebraic varieties

Peter Scheiblechner, Peter Bürgisser, Peter Bürgisser, 2009, J. Symb. Comput..

Geometric complexity theory and tensor rank pdf

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2010, STOC '11.

The real tau-conjecture is true on average pdf

Irénée Briquel, Peter Bürgisser, 2020, Random Struct. Algorithms.

Counting Irreducible Components of Complex Algebraic Varieties

Peter Scheiblechner, Peter Bürgisser, Peter Bürgisser, 2010, computational complexity.

Counting Complexity Classes for Numeric Computations I: Semilinear Sets

Felipe Cucker, Peter Bürgisser, F. Cucker, 2003, SIAM J. Comput..

Polynomial time algorithms in invariant theory for torus actions

Avi Wigderson, Peter Bürgisser, Michael Walter, 2021, CCC.

Optimization, Complexity and Invariant Theory (Invited Talk)

Peter Bürgisser, 2021, STACS.

General formulas for the smoothed analysis of condition numbers

Felipe Cucker, Peter Bürgisser, Martin Lotz, 2006 .

How applying Myhill Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding

Peter Bürgisser, Carsten Rösnick, Pascal Lenzner, .

Smoothed Analysis of Condition Numbers

Peter Bürgisser, Peter Bürgisser, 2011 .

Incorporating severity variations into credit risk

Peter Bürgisser, Alexandre Kurth, Peter Bürgisser, 2001 .

Typical Tensorial Rank

Michael Clausen, Peter Bürgisser, Mohammad Amin Shokrollahi, 1997 .

Condition Numbers and Iterative Algorithms

Felipe Cucker, Peter Bürgisser, 2013 .

Homotopy Continuation and Newton’s Method

Felipe Cucker, Peter Bürgisser, 2013 .

The complexity to compute the Euler characteristic of complex varieties

Felipe Cucker, Peter Bürgisser, Martin Lotz, 2004 .

Variations by complexity theorists on three themes of Euler , Bézout , Betti , and Poincaré

Peter Bürgisser, Peter Bürgisser, 2004 .

The complexity of computing Kronecker coefficients

Peter Bürgisser, Christian Ikenmeyer, Peter Bürgisser, 2008 .

Algebraic Complexity Theory : With the Collaboration of Thomas Lickteig

Michael Clausen, Peter Bürgisser, Mohammad Amin Shokrollahi, 1997 .

No occurrence obstructions in geometric complexity theory

Greta Panova, Peter Bürgisser, Christian Ikenmeyer, 2018, Journal of the American Mathematical Society.