direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Search for Publication

Suche nach Publikationen




All Publications

<< zurück [1]
vor >> [10]

Kohn, K. - Coisotropic Hypersurfaces in the Grassmannian [11], Preprint 2016.


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


Breiding, P. and Bürgisser, P. - Distribution of the eigenvalues of a random system of homogeneous polynomials [13]. 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 [14]. 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 [15]. 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 [16]. Found. Comput. Math. 16(6) pp. 1401–1422, 2016.


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


Breiding, P. - An adaptive linear homotopy method to approximate eigenpairs of homogeneous polynomial systems [18], Preprint 2015.


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


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


Lairez, P. - A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time [21], 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 [22]. 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 [23]. Mathematical Programming 149(1-2) pp. 105-130, 2015.


Bürgisser, P. and Cucker, F. - A stable, polynomial-time algorithm for the eigenpair problem [24], 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 [25]. Journal of Computer and System Sciences 80(1) pp. 277-296, 2014.


<< zurück [26]
vor >> [35]
------ Links: ------

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008