HTML Export for Dagstuhl Seminar Proceedings, Volume 7411

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 7411, </h2>
<ul>
<li>
    <span class="authors">Manindra Agrawal, Harry Buhrman, Lance Fortnow, and Thomas Thierauf</span>
    <span class="title">07411 Abstracts Collection – Algebraic Methods in Computational Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07411.1">10.4230/DagSemProc.07411.1</a>
</li>
<li>
    <span class="authors">Manindra Agrawal, Harry Buhrman, Lance Fortnow, and Thomas Thierauf</span>
    <span class="title">07411 Executive Summary – Algebraic Methods in Computational Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07411.2">10.4230/DagSemProc.07411.2</a>
</li>
<li>
    <span class="authors">Farid Ablayev</span>
    <span class="title">Classical Simulation Complexity of  Quantum  Branching Programs</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07411.3">10.4230/DagSemProc.07411.3</a>
</li>
<li>
    <span class="authors">Nitin Saxena</span>
    <span class="title">Diagonal Circuit Identity Testing and Lower Bounds</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07411.4">10.4230/DagSemProc.07411.4</a>
</li>
<li>
    <span class="authors">Nikolai K. Vereshchagin, Harry Buhrman, Matthias Cristandl, Michal Koucky, Zvi Lotker, and Boaz Patt-Shamir</span>
    <span class="title">High Entropy Random Selection Protocols</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07411.5">10.4230/DagSemProc.07411.5</a>
</li>
<li>
    <span class="authors">Julia Kempe, Oded Regev, and Ben Toner</span>
    <span class="title">The Unique Games Conjecture with Entangled Provers is False</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07411.6">10.4230/DagSemProc.07411.6</a>
</li>
<li>
    <span class="authors">Frederic Green and Amitabha Roy</span>
    <span class="title">Uniqueness of Optimal Mod 3 Circuits  for Parity</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07411.7">10.4230/DagSemProc.07411.7</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