Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDagstuhl 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.
a service of 
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.
last updated on 2024-08-14 22:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
