Dagstuhl Seminar Proceedings 08381

Computational Complexity of Discrete Problems

P. B. Miltersen, R. Reischuk, G. Schnitger, D. v. Melkebeek (Eds.)

published by LZI
Host

ISSN  1862 - 4405

Dagstuhl Seminar 08381, 14.09. - 19.09.2008
Additional Information
Seminar Homepage
License
Search Publication Server

Authors
  • Ben-Sasson, Eli
  • Hansen, Kristoffer Arnsfelt
  • Kedlaya, Kiran
  • Lee, Troy
  • Miltersen, Peter Bro
  • Nordström, Jakob
  • Reischuk, Rüdiger
  • Schnitger, Georg
  • Shraibman, Adi
  • Umans, Christopher
  • van Melkebeek, Dieter

  •   
    08381 Abstracts Collection -- Computational Complexity of Discrete Problems
    Authors: Miltersen, Peter Bro ; Reischuk, Rüdiger ; Schnitger, Georg ; van Melkebeek, Dieter

    Abstract | Document (231 KB) | BibTeX

    08381 Executive Summary -- Computational Complexity of Discrete Problems
    Authors: Miltersen, Peter Bro ; Reischuk, Rüdiger ; Schnitger, Georg ; van Melkebeek, Dieter

    Abstract | Document (103 KB) | BibTeX

    Approximation norms and duality for communication complexity lower bounds
    Authors: Lee, Troy ; Shraibman, Adi

    Abstract | Document (174 KB) | BibTeX

    Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
    Authors: Hansen, Kristoffer Arnsfelt

    Abstract | Document (211 KB) | BibTeX

    Fast polynomial factorization and modular composition
    Authors: Kedlaya, Kiran ; Umans, Christopher

    Abstract | Document (340 KB) | BibTeX

    Understanding space in resolution: optimal lower bounds and exponential trade-offs
    Authors: Ben-Sasson, Eli ; Nordström, Jakob

    Abstract | Document (474 KB) | BibTeX

      




    DROPS-Home | Fulltext Search | Imprint
    Published by LZI