TU Berlin

Fachgebiet Algorithmische AlgebraIn Proceedings

Inhalt des Dokuments

zur Navigation

In Proceedings

Bürgisser, P., Franks, C., Garg, A., Oliveira, R., Walter, M. and Wigderson, A. - Efficient algorithms for tensor scaling, quantum marginals and moment polytopes. Proceedings 59th Annual IEEE Symposium on Foundations of Computer Science pp. 883-897, 04/ 2018.


Bürgisser, P., Garg, A., Oliveira, R., Walter, M. and Wigderson, A. - Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. 9th Innovations in Theoretical Computer Science Leibniz International Proceedings in Informatics (LIPIcs) 94 pp. 24:1–24:20, 11/ 2017.


Bürgisser, P., Ikenmeyer, C. and Panova, G. - No occurrence obstructions in geometric complexity theory. Proceedings 57th Annual IEEE Symposium on Foundations of Computer Science pp. 386–395, 04/ 2016.


Bürgisser, P., Kohn, K., Lairez, P. and Sturmfels, B. - Computing the Chow variety of quadratic space curves. Mathematical Aspects of Computer and Information Sciences (eds. I. Kotsireas, S. Rump and C. Yap) - MACIS 2015, Berlin, Germany, November 11-13, Revised Selected Papers pp. 130-136, 4/ 2016.


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.


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.


Mengel, S. - Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems. In Proceedings of ICALP 2011 Lecture Notes in Computer Science 6755 pp. 700-711, . Springer, 2011.


Bürgisser, P. and Ikenmeyer, C. - Geometric Complexity Theory and Tensor Rank. Proceedings 43rd Annual ACM Symposium on Theory of Computing 2011 pp. 509-518, 2011.


Bürgisser, P. - Smoothed analysis of condition numbers. Proceedings of the International Congress of Mathematicians IV pp. 2609-2633, . Hindustan Book Agency, New Delhi, 2010.


Bürgisser, P. and Cucker, F. - Solving Polynomial Equations in Smoothed Polynomial Time and a Near Solution to Smale's 17th Problem. In Proceedings STOC 2010 pp. 503-512, 2010.


Bürgisser, P., Gathen, J. v. z., Goldreich, O. and Sudan, M. - Oberwolfach Report No. 52/2009 on "Complexity Theory". 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. FPSAC 2009 DMTCS proc. AK pp. 267-278, Hagenberg, Austria, 2009.


Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe