www-cc.cs.uni-sb.de
Computatational Complexity - Bachelor's and Master's Theses
http://www-cc.cs.uni-sb.de/theses
Department of Computer Science. Computational Complexity - Bachelor's and Master's Theses. If you are interested in doing a thesis in the computational complexity group, please contact any member of the group. Below is only a small sample of possible topics. Feel free to ask for more topics or suggest a topic of your own. The structure of split planar graphs. Upper bounds and the rank and border rank of small tensors by computer methods. A Smoothed Analytic Approach to the Integer Factoring Problem.
www-cc.cs.uni-sb.de
Computational Complexity - Research Seminar
http://www-cc.cs.uni-sb.de/seminar
Department of Computer Science. Computational Complexity - Research Seminar. Room 415, Building E1.3.
www-cc.cs.uni-sb.de
Computational Complexity - Teaching
http://www-cc.cs.uni-sb.de/courses
Department of Computer Science. Computational Complexity - Teaching. Bachelor's and Master's Theses. Advanced Lecture "Holographic algorithms". Advanced Lecture "Introduction to the Asian board game GO". Proseminar "Berechenbarkeits- und Automatentheorie". Doctoral privatissimum "Advanced Complexity Theory". Lecture "Grundzüge der Algorithmen und Datenstrukturen". Advanced Lecture "Tensors in Computer Science". Lecture "Grundzüge der Theoretischen Informatik". Lecture "Advanced Complexity Theory". Lectur...
www-cc.cs.uni-sb.de
Computational Complexity - Conferences and Workshops
http://www-cc.cs.uni-sb.de/workshops
Department of Computer Science. Workshop on Algebraic Complexity Theory - 2015. Workshop on Algebraic Complexity Theory - 2014.
www-cc.cs.uni-sb.de
Computational Complexity - Publications
http://www-cc.cs.uni-sb.de/publication
Department of Computer Science. László Kozma and Tobias Mömke. Maximum Scatter TSP in Doubling Metrics. Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, and Hang Zhou. To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. Adam Kurpisz, Monaldo Mastrolilli , Claire Mathieu, Tobias Mömke, Victor Verdugo, and Andreas Wiese. Semidefinite and linear programming integrality gaps for scheduling identical machines. Anna Adamaszek, Antonios Antoniadis and Tobias Mömke. Monika Henzing...
www-cc.cs.uni-sb.de
Computational Complexity - Workshop on Algebraic Complexity Theory - WACT 2015
http://www-cc.cs.uni-sb.de/wact2015
Department of Computer Science. Workshop on Algebraic Complexity Theory - WACT 2015. The slides can be found in the program. On 16-20 March 2015, Saarland University hosts the Workshop on Algebraic Complexity Theory - WACT 2015. Was held in Saarbrücken, Germany. Was held in Aarhus, Denmark. V Arvind - IMSc Chennai. Michael Forbes - Simons Institute, Berkeley. Neeraj Kayal - Microsoft Research India. Pascal Koiran - ENS Lyon. Guillaume Malod - Universite Paris Diderot. March 16 to 20, 2015. Departement of...