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]

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


Bürgisser, P., Cucker, F. and Naurois, P. J. d. - The complexity of semilinear problems in succinct representation [12]. 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 [13]. Foundations of Computational Mathematics 5(4) pp. 351-387, 2005.


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


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


Bürgisser, P. - The Complexity of Factors of Multivariate Polynomials [16]. 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 [17]. 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 [18]. 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 [19]. In Proceedings of 36th STOC pp. 475-485, Chicago, 2004.


Bürgisser, P. and Cucker, F. - Counting Complexity Classes for Numeric Computations I: Semilinear Sets [20]. SIAM J. Comp. 33(1) pp. 227-260, 2003.


Bürgisser, P. and Cucker, F. - Counting Complexity Classes over the Reals I: The Additive Case [21]. In Proceedings of ISAAC 2003 Lecture Notes in Computer Science (2906) pp. 625-634, . Springer, 2003.


Bürgisser, P. and Lotz, M. - Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps [22]. In Proceedings of 43rd FOCS pp. 658-668, Vancouver, November 16-19/ 2002.


Bürgisser, P. - The Complexity of Factors of Multivariate Polynomials [23]. Proceedings 42nd FOCS pp. 378-385, Las Vegas, October 14-17/ 2001.


Bürgisser, P., Kurth, A. and Wagner, A. - Incorporating Severity Variations into Credit Risk [24]. Journal of Risk 3(4) pp. 5-31, 2001.


Bürgisser, P. - On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity [25]. Proc. 26th Symposium on Mathematical Foundations of Computer Science Lecture Notes in Computer Science (2136) pp. 3-17, . Springer Verlag, Marianske Lazne, 2001.


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

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008