Dagstuhl Seminar Proceedings: Algorithms and Complexity for Continuous Problems 2006
Stephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub (Eds.): Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 Dagstuhl Seminar Proceedings 06391- Howard Barnum: Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries.
- Klaus Meer, Martin Ziegler: Real Computational Universality: The Word Problem for a class of groups with infinite presentation.
- Stephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub: 06391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team