default search action
Dagstuhl Seminar Proceedings: Algorithms and Complexity for Continuous Problems 2006
- Stephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006. Dagstuhl Seminar Proceedings 06391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 - 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.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.