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 >> [11]

Bürgisser, P. and Ikenmeyer, C. - A max-flow algorithm for positivity of Littlewood-Richardson coefficients [12]. FPSAC 2009 DMTCS proc. AK pp. 267-278, Hagenberg, Austria, 2009.


Bürgisser, P. - Smoothed Analysis of Condition Numbers [13]. Foundations of Computational Mathematics London Mathematical Society Lecture Note Series (363) pp. 1- 41, . Cambridge University Press, Hong Kong, 2009.


Bürgisser, P., Cucker, F. and Lotz, M. - The probability that a slightly perturbed numerical analysis problem is difficult [14]. Math. Comp. 77 pp. 1559-1583, 2008.


Bürgisser, P. and Ikenmeyer, C. - The Complexity of Computing Kronecker Coefficients [15]. FPSAC 2008 DMTCS proc. AJ pp. 357-368, Valparaiso-Viña del Mar, Chile, 2008.


Ikenmeyer, C. - On the complexity of computing Kronecker coefficients and deciding positivity of Littlewood-Richardson coefficients [16]. Diplomarbeit, Universität Paderborn 2008.


Bürgisser, P. and Scheiblechner, P. - Differential Forms in Computational Algebraic Geometry [17]. Proc. of ISSAC pp. 61-68, Waterloo, Canada, 2007.


Bürgisser, P. - Average Euler Characteristic of Random Real Algebraic Varieties [18]. Comptes Rendus - Mathematique 345(9) pp. 507-512, 2007.


Scheiblechner, P. - On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety [19]. Journal of Complexity 23(3) pp. 359-379, 2007.


Bürgisser, P. and Lotz, M. - The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties [20]. Foundations of Computational Mathematics 7(1) pp. 51-86, 2007.


Bürgisser, P. and Cucker, F. - Exotic quantifiers, complexity classes, and complete problems [21]. Proc. of ICALP 2007 Lecture Notes in Computer Science (4596) pp. 207-218, 2007.


Scheiblechner, P. - On the Complexity of Counting Irreducible Components and Computing Betti Numbers of Algebraic Varieties [22]. Dissertation, Universität Paderborn 2007.


Allender, E., Bürgisser, P., Kjeldgaard-Pedersen, J. and Miltersen, P. B. - On the Complexity of Numerical Analysis (Conference Version) [23]. In Proc. of 21st Ann. IEEE Conference on Computational Complexity pp. 331-339, Prague, 2006.


Bürgisser, P., Cucker, F. and Lotz, M. - General formulas for the smoothed analysis of condition numbers [24]. C. R. Acad. Sci. Paris Ser. I 343(2) pp. 145-150, 2006.


Bürgisser, P., Cucker, F. and Lotz, M. - Smoothed analysis of complex conic condition numbers [25]. Journal de Mathématiques Pures et Appliquées 86 pp. 293-309, 2006.


Bürgisser, P., Cucker, F. and Naurois, P. J. d. - The complexity of semilinear problems in succinct representation [26]. Computational Complexity 15(3) pp. 197-235, 2006.


<< zurück [27]
vor >> [37]
------ Links: ------

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.
Copyright TU Berlin 2008