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]

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


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


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


Allender, E., Bürgisser, P., Kjeldgaard-Pedersen, J. and Miltersen, P. B. - On the Complexity of Numerical Analysis [15]. SIAM J. Comput. 38(5) pp. 1987-2006, 2009.


Bürgisser, P., Gathen, J. v. z., Goldreich, O. and Sudan, M. - Oberwolfach Report No. 52/2009 on "Complexity Theory" [16]. Oberwolfach Reports 6(4) pp. 2787-2850, European Mathematical Society, 2009.


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


Bürgisser, P. - Smoothed Analysis of Condition Numbers [18]. 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 [19]. Math. Comp. 77 pp. 1559-1583, 2008.


Bürgisser, P. and Ikenmeyer, C. - The Complexity of Computing Kronecker Coefficients [20]. 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 [21]. Diplomarbeit, Universität Paderborn 2008.


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


Bürgisser, P. - Average Euler Characteristic of Random Real Algebraic Varieties [23]. 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 [24]. 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 [25]. Foundations of Computational Mathematics 7(1) pp. 51-86, 2007.


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


<< 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