Publications

# Publications :: Search

## Show author

 Select a publication Show Title Venue Rating Date Journal article Felipe Cucker, Peter Bürgisser, Pierre Lairez. Computing the homology of basic semialgebraic sets in weak exponential time. CoRR 2017, Volume 0 (0) 2017 Conference paper Peter Bürgisser, Matthias Christandl, Ketan Mulmuley, Michael Walter. Membership in Moment Polytopes is in NP and coNP. SIAM J. Comput. 2017, Volume 46 (0) 2017 Journal article Peter Bürgisser, Felipe Cucker, Elisa Rocha Cardozo. On the condition of the zeros of characteristic polynomials. J. Complexity 2017, Volume 42 (0) 2017 Conference paper Peter Bürgisser, Christian Ikenmeyer, Greta Panova. No occurrence obstructions in geometric complexity theory. CoRR 2016, Volume 0 (0) 2016 Conference paper Diego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, Michael Shub. Condition Length and Complexity for the Solution of Polynomial Systems. Foundations of Computational Mathematics 2016, Volume 16 (0) 2016 Conference paper Peter Bürgisser, Christian Ikenmeyer, Greta Panova. No Occurrence Obstructions in Geometric Complexity Theory. IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016 Journal article Dennis Amelunxen, Peter Bürgisser. Probabilistic Analysis of the Grassmann Condition Number. Foundations of Computational Mathematics 2015, Volume 15 (0) 2015 Journal article Dennis Amelunxen, Peter Bürgisser. Intrinsic volumes of symmetric cones and applications in convex programming. Math. Program. 2015, Volume 149 (0) 2015 Journal article Peter Bürgisser, Christian Ikenmeyer, Jesko Hüttenhain. Permanent versus determinant: not via saturations of monoids of representations. CoRR 2015, Volume 0 (0) 2015 Journal article Peter Bürgisser, Kathlén Kohn, Pierre Lairez, Bernd Sturmfels. Computing the Chow variety of quadratic space curves. CoRR 2015, Volume 0 (0) 2015 Conference paper Peter Bürgisser, Christian Ikenmeyer. Fundamental invariants of orbit closures. CoRR 2015, Volume 0 (0) 2015 Conference paper Peter Bürgisser. Permanent versus determinant, obstructions, and Kronecker coefficients. CoRR 2015, Volume 0 (0) 2015 Conference paper Peter Bürgisser, Matthias Christandl, Ketan Mulmuley, Michael Walter. Membership in moment polytopes is in NP and coNP. CoRR 2015, Volume 0 (0) 2015 Conference paper Peter Bürgisser, Kathlén Kohn, Pierre Lairez, Bernd Sturmfels. Computing the Chow Variety of Quadratic Space Curves. Mathematical Aspects of Computer and Information Sciences - 6th International Conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers 2016 (0) 2015 Conference paper Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai Vorobjov. Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). Dagstuhl Reports 2015, Volume 5 (0) 2015 Conference paper Peter Bürgisser, Christian Ikenmeyer. Explicit lower bounds via geometric complexity theory. Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 2013 (0) 2013 Journal article Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran. Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports 2013, Volume 3 (0) 2013 Conference paper Peter Bürgisser, Christian Ikenmeyer. Deciding Positivity of Littlewood-Richardson Coefficients. SIAM J. Discrete Math. 2013, Volume 27 (0) 2013 Journal article Peter Bürgisser, Dennis Amelunxen. Robust smoothed analysis of a condition number for linear programming. Math. Program. 2012, Volume 131 (0) 2012 Conference paper Peter Bürgisser. Prospects for Geometric Complexity Theory. Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012 2012 (0) 2012 Journal article Peter Bürgisser, Christian Ikenmeyer. Explicit Lower Bounds via Geometric Complexity Theory CoRR 2012, Volume 0 (0) 2012 Conference paper Dennis Amelunxen, Peter Bürgisser. A Coordinate-Free Condition Number for Convex Programming. SIAM Journal on Optimization 2012, Volume 22 (0) 2012 Conference paper Peter Bürgisser, Christian Ikenmeyer. Geometric complexity theory and tensor rank. Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 2011 (0) 2011 Conference paper Peter Bürgisser. Probabilistic analysis of condition numbers. Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings 2011 (0) 2011 Conference paper Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman. An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$. SIAM J. Comput. 2011, Volume 40 (0) 2011 Conference paper Peter Bürgisser, Felipe Cucker. Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 2010 (0) 2010 Journal article Peter Bürgisser, Peter Scheiblechner. Counting Irreducible Components of Complex Algebraic Varieties. Computational Complexity 2010, Volume 19 (0) 2010 Journal article Peter Bürgisser, Felipe Cucker. Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Analysis Applications 2010, Volume 31 (0) 2010 Conference paper Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum. 10481 Abstracts Collection - Computational Counting. Computational Counting, 28.11. - 03.12.2010 2010 (0) 2010 Conference paper Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum. 10481 Executive Summary - Computational Counting. Computational Counting, 28.11. - 03.12.2010 2010 (0) 2010 Conference paper Peter Bürgisser. On Defining Integers And Proving Arithmetic Circuit Lower Bounds. Computational Complexity 2009, Volume 18 (0) 2009 Conference paper Peter Bürgisser, Felipe Cucker. Exotic Quantifiers, Complexity Classes, and Complete Problems. Foundations of Computational Mathematics 2009, Volume 9 (0) 2009 Conference paper Peter Bürgisser, Peter Scheiblechner. On the complexity of counting components of algebraic varieties. J. Symb. Comput. 2009, Volume 44 (0) 2009 Conference paper Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. On the Complexity of Numerical Analysis. SIAM J. Comput. 2008, Volume 38 (0) 2009 Journal article Peter Bürgisser, Felipe Cucker, Martin Lotz. The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comput. 2008, Volume 77 (0) 2008 Conference paper Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich. Guest Editor's Preface. J. Complexity 2008, Volume 24 (0) 2008 Conference paper Peter Bürgisser, Felipe Cucker. Exotic Quantifiers, Complexity Classes, and Complete Problems. Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings 2007 (0) 2007 Conference paper Peter Bürgisser, Peter Scheiblechner. Differential forms in computational algebraic geometry. Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings 2007 (0) 2007 Conference paper Peter Bürgisser. On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds. STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings 2007 (0) 2007 Conference paper Peter Bürgisser, Martin Lotz. The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties. Foundations of Computational Mathematics 2007, Volume 7 (0) 2007 Conference paper Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. On the Complexity of Numerical Analysis. 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic 2006 (0) 2006 Conference paper Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. On the Complexity of Numerical Analysis. Complexity of Boolean Functions, 12.03. - 17.03.2006 2006 (0) 2006 Conference paper Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois. The complexity of semilinear problems in succinct representation. Computational Complexity 2006, Volume 15 (0) 2006 Conference paper Peter Bürgisser. On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity. Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null (0) 2006 Conference paper Peter Bürgisser, Felipe Cucker. Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complexity 2006, Volume 22 (0) 2006 Conference paper Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois. The Complexity of Semilinear Problems in Succinct Representation. Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings 2005 (0) 2005 Conference paper Peter Bürgisser, Martin Lotz. The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties CoRR 2005, Volume 0 (0) 2005 Conference paper Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. On the Complexity of Numerical Analysis Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005 Conference paper Peter Bürgisser, Felipe Cucker. Exotic quantifiers, complexity classes, and complete problems Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005 Conference paper Peter Bürgisser, Felipe Cucker, Martin Lotz. Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Foundations of Computational Mathematics 2005, Volume 5 (0) 2005 Conference paper Peter Bürgisser, Felipe Cucker. Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004 2004 (0) 2004 Conference paper Peter Bürgisser. The Complexity of Factors of Multivariate Polynomials. Foundations of Computational Mathematics 2004, Volume 4 (0) 2004 Conference paper Peter Bürgisser, Martin Lotz. Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM 2004, Volume 51 (0) 2004 Conference paper Peter Bürgisser, Felipe Cucker. Counting Complexity Classes for Numeric Computations I: Semilinear Sets. SIAM J. Comput. 2004, Volume 33 (0) 2003 Conference paper Peter Bürgisser, Felipe Cucker. Counting Complexity Classes over the Reals I: The Additive Case. Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings 2003 (0) 2003 Conference paper Peter Bürgisser, Martin Lotz. Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps CoRR 2003, Volume 0 (0) 2003 Conference paper Peter Bürgisser, Felipe Cucker. Counting complexity classes for numeric computations II: algebraic and semialgebraic sets CoRR 2003, Volume 0 (0) 2003 Conference paper Peter Bürgisser, Martin Lotz. Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings 2002 (0) 2002 Conference paper Peter Bürgisser. Lower Bounds and Real Algebraic Geometry. Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, Proceedings of a DIMACS Workshop, Piscataway, NJ, USA, March 12-16, 2001 2001 (0) 2001 Conference paper Peter Bürgisser. The Complexity of Factors of Multivariate Polynomials. FOCS 2001 (0) 2001 Conference paper Peter Bürgisser. On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings 2001 (0) 2001 Conference paper Peter Bürgisser. The Computational Complexity to Evaluate Representations of General Linear Groups. SIAM J. Comput. 2000, Volume 30 (0) 2000 Conference paper Peter Bürgisser. The Computational Complexity of Immanants. SIAM J. Comput. 2000, Volume 30 (0) 2000 Conference paper Peter Bürgisser. Cook's versus Valiant's hypothesis. Theor. Comput. Sci. 2000, Volume 235 (0) 2000 Conference paper Peter Bürgisser. On the Structure of Valiant's Complexity Classes. Discrete Mathematics Theoretical Computer Science 1999, Volume 3 (0) 1999 Conference paper Peter Bürgisser. On the Structure of Valiant's Complexity Classes. STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998 (0) 1998 Conference paper Peter Bürgisser. On the Parallel Complexity of the Polynomial Ideal Membership Problem. J. Complexity 1998, Volume 14 (0) 1998 Conference paper Peter Bürgisser, Marek Karpinski, Thomas Lickteig. On Randomized Semi-algebraic Test Complexity. J. Complexity 1993, Volume 9 (0) 1993 Conference paper Peter Bürgisser, Thomas Lickteig, Michael Shub. Test complexity of generic polynomials. J. Complexity 1992, Volume 8 (0) 1992 Conference paper Peter Bürgisser, Marek Karpinski, Thomas Lickteig. Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Computational Complexity 1991, Volume 1 (0) 1991