direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Search for Publication

Suche nach Publikationen




All Publications


Bürgisser, P. - Permanent versus determinant, obstructions, and Kronecker coefficients. Séminaire Lotharingien de Combinatoire 75 , 2016.


Breiding, P. and Bürgisser, P. - Distribution of the eigenvalues of a random system of homogeneous polynomials. Linear Algebra and its Applications 497 pp. 88-107, 2016.


Bürgisser, P., Ikenmeyer, C. and Panova, G. - No occurrence obstructions in geometric complexity theory. Proceedings 57th Annual IEEE Symposium on Foundations of Computer Science pp. 386–395, 04/ 2016.


Bürgisser, P., Kohn, K., Lairez, P. and Sturmfels, B. - Computing the Chow variety of quadratic space curves. Mathematical Aspects of Computer and Information Sciences (eds. I. Kotsireas, S. Rump and C. Yap) - MACIS 2015, Berlin, Germany, November 11-13, Revised Selected Papers pp. 130-136, 4/ 2016.


Armentano, D., Beltrán, C., Bürgisser, P., Cucker, F. and Shub, M. - Condition length and complexity for the solution of polynomial systems. Found. Comput. Math. 16(6) pp. 1401–1422, 2016.


Ikenmeyer, C. - Small Littlewood-Richardson coefficients. Journal of Algebraic Combinatorics 44(1) pp. 1–29, 2016.



Bürgisser, P., Cucker, F. and Cardozo, E. R. - Characteristic polynomials of typical matrices are ill-conditioned, Preprint 2015.


Bürgisser, P. - Condition of intersecting a projective variety with a varying linear subspace, Preprint 2015. To appear in SIAGA.


Lairez, P. - A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time, Preprint 2015. To appear in Foundations of computational mathematics (2016), 23 pages.


Amelunxen, D. and Bürgisser, P. - Probabilistic analysis of the Grassmann condition number. Foundations of Computational Mathematics 15(1) pp. 3-51, 2015.


Amelunxen, D. and Bürgisser, P. - Intrinsic volumes of symmetric cones and applications in convex programming. Mathematical Programming 149(1-2) pp. 105-130, 2015.


Bürgisser, P. and Cucker, F. - A stable, polynomial-time algorithm for the eigenpair problem, Preprint 2014. This preprint was merged in 2015 with arXiv:1410.2179 into arXiv:1505.03290.


Durand, A. and Mengel, S. - The Complexity of Weighted Counting for Acyclic Conjunctive Queries. Journal of Computer and System Sciences 80(1) pp. 277-296, 2014.


Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe