HTML Export for Dagstuhl Seminar Proceedings, Volume 8381

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 8381, </h2>
<ul>
<li>
    <span class="authors">Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, and Dieter van Melkebeek</span>
    <span class="title">08381 Abstracts Collection – Computational Complexity of Discrete Problems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08381.1">10.4230/DagSemProc.08381.1</a>
</li>
<li>
    <span class="authors">Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, and Dieter van Melkebeek</span>
    <span class="title">08381 Executive Summary – Computational Complexity of Discrete Problems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08381.2">10.4230/DagSemProc.08381.2</a>
</li>
<li>
    <span class="authors">Troy Lee and Adi Shraibman</span>
    <span class="title">Approximation norms and duality for communication complexity lower bounds</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08381.3">10.4230/DagSemProc.08381.3</a>
</li>
<li>
    <span class="authors">Kristoffer Arnsfelt Hansen</span>
    <span class="title">Depth Reduction for Circuits with a Single Layer of Modular Counting Gates</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08381.4">10.4230/DagSemProc.08381.4</a>
</li>
<li>
    <span class="authors">Kiran Kedlaya and Christopher Umans</span>
    <span class="title">Fast polynomial factorization and modular composition</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08381.5">10.4230/DagSemProc.08381.5</a>
</li>
<li>
    <span class="authors">Eli Ben-Sasson and Jakob Nordström</span>
    <span class="title">Understanding space in resolution: optimal lower bounds and exponential trade-offs</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.08381.6">10.4230/DagSemProc.08381.6</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode