Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Stephan Dahlke, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. 06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{dahlke_et_al:DagSemProc.06391.1, author = {Dahlke, Stephan and Ritter, Klaus and Sloan, Ian H. and Traub, Joseph F.}, title = {{06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--21}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06391.1}, URN = {urn:nbn:de:0030-drops-8782}, doi = {10.4230/DagSemProc.06391.1}, annote = {Keywords: Computational complexity, partial information, high-dimensional problems, operator equations, non-linear approximation, quantum computation, stochastic computation, ill posed-problems} }
Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Klaus Meer and Martin Ziegler. Real Computational Universality: The Word Problem for a class of groups with infinite presentation. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{meer_et_al:DagSemProc.06391.2, author = {Meer, Klaus and Ziegler, Martin}, title = {{Real Computational Universality: The Word Problem for a class of groups with infinite presentation}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06391.2}, URN = {urn:nbn:de:0030-drops-8773}, doi = {10.4230/DagSemProc.06391.2}, annote = {Keywords: Computational group theory, word problem, Blum-Shub-Smale model} }
Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Howard Barnum. Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{barnum:DagSemProc.06391.3, author = {Barnum, Howard}, title = {{Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--25}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06391.3}, URN = {urn:nbn:de:0030-drops-8769}, doi = {10.4230/DagSemProc.06391.3}, annote = {Keywords: Quantum query complexity semidefinite programming} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Leszek Plakote, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401). Dagstuhl Seminar Report 356, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)
@TechReport{plakote_et_al:DagSemRep.356, author = {Plakote, Leszek and Ritter, Klaus and Sloan, Ian H. and Traub, Joseph F.}, title = {{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401)}}, pages = {1--18}, ISSN = {1619-0203}, year = {2003}, type = {Dagstuhl Seminar Report}, number = {356}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.356}, URN = {urn:nbn:de:0030-drops-152361}, doi = {10.4230/DagSemRep.356}, }
Feedback for Dagstuhl Publishing