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]

Scheiblechner, P. - On the Complexity of Counting Irreducible Components and Computing Betti Numbers of Algebraic Varieties [12]. 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) [13]. 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 [14]. 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 [15]. 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 [16]. Computational Complexity 15(3) pp. 197-235, 2006.


Bürgisser, P. and Cucker, F. - Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets [17]. Journal of Complexity 22(2) pp. 147-191, 2006.


Bürgisser, P. - Average volume, curvatures, and Euler characteristic of random real algebraic varieties [18], Preprint 2006.


Bürgisser, P., Cucker, F. and Naurois, P. J. d. - The complexity of semilinear problems in succinct representation [19]. Proceedings of 15th International Symposium on Fundamentals of Computation Theory Lecture Notes in Computer Science (3623) pp. 479-490, . Springer, Lübeck, August 17-20/ 2005.


Bürgisser, P., Cucker, F. and Lotz, M. - Counting Complexity Classes for Numeric Computations III: Complex Projective Sets [20]. Foundations of Computational Mathematics 5(4) pp. 351-387, 2005.


Lotz, M. - On Numerical Invariants in Algebraic Complexity Theory [21]. Dissertation, Universität Paderborn 2005.


Bürgisser, P., Cucker, F. and Lotz, M. - The Complexity to Compute the Euler Characteristic of Complex Varieties [22]. C. R. Acad. Sci. Paris Ser. I 339 pp. 371-376, 2004.


Bürgisser, P. - The Complexity of Factors of Multivariate Polynomials [23]. Foundations of Computational Mathematics 4(4) pp. 369-396, 2004.


Bürgisser, P. and Lotz, M. - Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps [24]. Journal of the ACM 51(3) pp. 464-482, 2004.


Lotz, M. and Makowsky, J. A. - On the algebraic complexity of some families of coloured Tutte polynomials [25]. Advances in Applied Mathematics 32(1-2) pp. 327-349, 2004.


Bürgisser, P. and Cucker, F. - Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets [26]. In Proceedings of 36th STOC pp. 475-485, Chicago, 2004.


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