direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

There is no English translation for this web page.

Search for Publication

Search for publications




All Publications

<< previous [1]
next >> [11]

Amelunxen, D. and Bürgisser, P. - A coordinate-free condition number for convex programming [12]. SIAM Journal on Optimization 22(3) pp. 1029-1041, 2012.


Bürgisser, P. and Amelunxen, D. - Robust Smoothed Analysis of a Condition Number for Linear Programming [13]. Mathematical Programming 131(1-2, Ser. A) pp. 221-251, 2012.


Ikenmeyer, C. - Geometric Complexity Theory, Tensor Rank, and Littlewood-Richardson Coefficients [14]. Dissertation, Universität Paderborn 2012.


Mengel, S. - Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems [15]. 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 [16]. 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 [17]. Journal of Algebra 328 pp. 322-329, 2011.


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


Bürgisser, P., Christandl, M. and Ikenmeyer, C. - Nonvanishing of Kronecker coefficients for rectangular shapes [19]. 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 [20]. SIAM J. Comput. 40(4) pp. 1179-1209, 2011.


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


Bürgisser, P. - Smoothed analysis of condition numbers [22]. 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 [23]. 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 [24]. In Proceedings STOC 2010 pp. 503-512, 2010.


Bürgisser, P. and Scheiblechner, P. - Counting Irreducible Components of Complex Algebraic Varieties [25]. 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 [26]. The Annals of Probability 38(2) pp. 570-604, 2010.


<< previous [27]
next >> [37]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.
Copyright TU Berlin 2008