Dagstuhl Seminar Proceedings: Computational Complexity of Discrete Problems 2008

> Home > Series > Dagstuhl Seminar Proceedings

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/2008P8381
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2008P8381
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
Computational Complexity of Discrete Problems, 14.09. - 19.09.2008. Dagstuhl Seminar Proceedings 08381, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/MiltersenRSM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/MiltersenRSM08
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
08381 Abstracts Collection - Computational Complexity of Discrete Problems.
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/MiltersenRSM08a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/MiltersenRSM08a
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
08381 Executive Summary - Computational Complexity of Discrete Problems.
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/LeeS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/LeeS08
Troy Lee, Adi Shraibman:
Approximation norms and duality for communication complexity lower bounds.
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/Hansen08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/Hansen08
Kristoffer Arnsfelt Hansen:
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates.
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/KedlayaU08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/KedlayaU08
Kiran S. Kedlaya, Christopher Umans:
Fast polynomial factorization and modular composition.
- view
  - electronic edition @ dagstuhl.de (open access)
  - details & citations
- export record
  dblp key:
  - conf/dagstuhl/Ben-SassonN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/Ben-SassonN08
Eli Ben-Sasson, Jakob Nordström:
Understanding space in resolution: optimal lower bounds and exponential trade-offs.

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.