TU Berlin

Fachgebiet Algorithmische AlgebraPublications

Inhalt des Dokuments

zur Navigation

Search for Publication

Suche nach Publikationen

All Publications

Mengel, S. - Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems. In Proceedings of ICALP 2011 Lecture Notes in Computer Science 6755 pp. 700-711, . Springer, 2011.

Bürgisser, P. and Ikenmeyer, C. - Geometric Complexity Theory and Tensor Rank. Proceedings 43rd Annual ACM Symposium on Theory of Computing 2011 pp. 509-518, 2011.

Bürgisser, P., Christandl, M. and Ikenmeyer, C. - Even partitions in plethysms. Journal of Algebra 328 pp. 322-329, 2011.

Bürgisser, P. and Cucker, F. - On a Problem Posed by Steve Smale. Annals of Mathematics 174(3) pp. 1785-1836, 2011.

Bürgisser, P., Christandl, M. and Ikenmeyer, C. - Nonvanishing of Kronecker coefficients for rectangular shapes. Advances in Mathematics 227 pp. 2082-2091, 2011.

Bürgisser, P., Landsberg, J. M., Manivel, L. and Weyman, J. - An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP. SIAM J. Comput. 40(4) pp. 1179-1209, 2011.

Amelunxen, D. - Geometric analysis of the condition of the convex feasibility problem. Dissertation, Universität Paderborn 2011.

Bürgisser, P. - Smoothed analysis of condition numbers. Proceedings of the International Congress of Mathematicians IV pp. 2609-2633, . Hindustan Book Agency, New Delhi, 2010.

Bürgisser, P. and Cucker, F. - Smoothed Analysis of Moore-Penrose Inversion. SIAM J. Matrix Anal. & Appl. 31(5) pp. 2769-2783, 2010.

Bürgisser, P. and Cucker, F. - Solving Polynomial Equations in Smoothed Polynomial Time and a Near Solution to Smale's 17th Problem. In Proceedings STOC 2010 pp. 503-512, 2010.

Bürgisser, P. and Scheiblechner, P. - Counting Irreducible Components of Complex Algebraic Varieties. Computational Complexity 19(1) pp. 1-35, 2010.

Bürgisser, P., Cucker, F. and Lotz, M. - Coverage Processes on Spheres and Condition Numbers for Linear Programming. The Annals of Probability 38(2) pp. 570-604, 2010.

Bürgisser, P. and Scheiblechner, P. - On the Complexity of Counting Components of Algebraic Varieties. Journal of Symbolic Computation 44(9) pp. 1114-1136, 2009.

Bürgisser, P. - On defining integers and proving arithmetic circuit lower bounds. Computational Complexity 18 pp. 81-103, 2009.

Bürgisser, P. and Cucker, F. - Exotic quantifiers, complexity classes, and complete problems. Foundations of Computational Mathematics 9(2) pp. 135-170, 2009.



Schnellnavigation zur Seite über Nummerneingabe