HTML Export for Dagstuhl Seminar Proceedings, Volume 9421

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 9421, </h2>
<ul>
<li>
    <span class="authors">Manindra Agrawal, Lance Fortnow, Thomas Thierauf, and Christopher Umans</span>
    <span class="title">09421 Abstracts Collection – Algebraic Methods in Computational Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09421.1">10.4230/DagSemProc.09421.1</a>
</li>
<li>
    <span class="authors">Manindra Agrawal, Lance Fortnow, Thomas Thierauf, and Christopher Umans</span>
    <span class="title">09421 Executive Summary – Algebraic Methods in Computational Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09421.2">10.4230/DagSemProc.09421.2</a>
</li>
<li>
    <span class="authors">Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova</span>
    <span class="title">An Axiomatic Approach to Algebrization</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09421.3">10.4230/DagSemProc.09421.3</a>
</li>
<li>
    <span class="authors">Noga Alon, Rina Panigrahy, and Sergey Yekhanin</span>
    <span class="title">Deterministic approximation algorithms for the nearest codeword problem</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09421.4">10.4230/DagSemProc.09421.4</a>
</li>
<li>
    <span class="authors">Harry Buhrman, David Garcia-Soriano, and Arie Matsliah</span>
    <span class="title">Learning Parities in the Mistake-Bound model</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09421.5">10.4230/DagSemProc.09421.5</a>
</li>
<li>
    <span class="authors">Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner</span>
    <span class="title">Planar Graph Isomorphism is in Log-Space</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09421.6">10.4230/DagSemProc.09421.6</a>
</li>
<li>
    <span class="authors">Meena Mahajan and Raghavendra Rao B. V.</span>
    <span class="title">Small space analogues of Valiant&#039;s classes and the limitations of   skew formula</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09421.7">10.4230/DagSemProc.09421.7</a>
</li>
<li>
    <span class="authors">Harry Buhrman, Lance Fortnow, and Rahul Santhanam</span>
    <span class="title">Unconditional Lower Bounds against Advice</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.09421.8">10.4230/DagSemProc.09421.8</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