direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Search for Publication

Suche nach Publikationen




All Publications

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


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


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


Hauenstein, J. D., Ikenmeyer, C. and Landsberg, J. M. - Equations for lower bounds on border rank. Experimental Mathematics 22(4) pp. 372–383, 2013.


Mengel, S. - Arithmetic Branching Programs with Memory. Mathematical foundations of computer science 2013 8087 pp. 667-678, . Springer, Heidelberg, 2013.


Capelli, F., Durand, A. and Mengel, S. - The arithmetic complexity of tensor contractions. Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2013 , 2013.


Durand, A. and Mengel, S. - Structural Tractability of Counting of Solutions to Conjunctive Queries. Proceeding of the 16th International Conference on Database Theory (ICDT 2013) , 2013.


Bürgisser, P. and Ikenmeyer, C. - Explicit Lower Bounds via Geometric Complexity Theory. Proceedings 45th ACM Symposium on Theory of Computing pp. 141-150, 2013.


Bürgisser, P. and Ikenmeyer, C. - Deciding Positivity of Littlewood-Richardson coefficients. SIAM J. Discrete Math. 27(4) pp. 1639-1681, 2013.


Mengel, S. - Conjunctive Queries, Arithmetic Circuits and Counting Complexity. Dissertation, Universität Paderborn 2013.


Amelunxen, D. and Bürgisser, P. - Intrinsic volumes of symmetric cones, Preprint 2012. A substantially revised and shortened version of this preprint has been published in Mathematical Programming 149(1-2) pp. 105-130, 2015.


Fournier, H., Malod, G. and Mengel, S. - Monomials in arithmetic circuits: Complete problems in the counting hierarchy. Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2012 , 2012.


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.