<h2>Dagstuhl Seminar Proceedings, Volume 6391, </h2> <ul> <li> <span class="authors">Stephan Dahlke, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub</span> <span class="title">06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06391.1">10.4230/DagSemProc.06391.1</a> </li> <li> <span class="authors">Klaus Meer and Martin Ziegler</span> <span class="title">Real Computational Universality: The Word Problem for a class of groups with infinite presentation</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06391.2">10.4230/DagSemProc.06391.2</a> </li> <li> <span class="authors">Howard Barnum</span> <span class="title">Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06391.3">10.4230/DagSemProc.06391.3</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
Feedback for Dagstuhl Publishing