Computational Complexity of Discrete Problems

Keyphrases

Publications

2008

Troy Lee, Adi Shraibman
Approximation norms and duality for communication complexity lower bounds. Computational Complexity of Discrete Problems (2008)
Kiran S. Kedlaya, Christopher Umans
Fast polynomial factorization and modular composition. Computational Complexity of Discrete Problems (2008)
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
08381 Executive Summary - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems (2008)
Kristoffer Arnsfelt Hansen
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. Computational Complexity of Discrete Problems (2008)
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek
08381 Abstracts Collection - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems (2008)
Eli Ben-Sasson, Jakob Nordström
Understanding space in resolution: optimal lower bounds and exponential trade-offs. Computational Complexity of Discrete Problems (2008)

volume 8381, 2008

Computational Complexity of Discrete Problems, 14.09. - 19.09.2008 Computational Complexity of Discrete Problems 8381 (2008)