default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd FotFS 2001: Vienna, Austria
- Benedikt Löwe, Boris Piwinger, Thoralf Räsch:
Classical and New Paradigms of Computation and their Complexity Hierarchies, Papers of the conference "Foundations of the Formal Sciences III", Wien, Asutria, September 21-24, 2001. Trends in Logic 23, Springer 2004, ISBN 978-1-4020-2775-8 - Benedikt Löwe:
Complexity hierarchies derived from reduction functions. 1-14 - Andris Ambainis:
Quantum query algorithms and lower bounds. 15-32 - Markus Bläser:
Algebras of minimal rank: overview and recent developments. 33-46 - Jörg Brendle:
Recent developments in iterated forcing theory. 47-60 - Riccardo Camerlo:
Classification problems in algebra and topology. 61-75 - Lars Engebretsen:
Using easy optimization problems to solve hard ones. 77-93 - Stefan Geschke, Sandra Quickert:
On Sacks forcing and the Sacks property. 95-139 - Joel David Hamkins:
Supertask computation. 141-158 - Peter Koepke, Marc van Eijmeren:
A refinement of Jensen's constructible hierarchy. 159-169 - Elvira Mayordomo Cámara:
Effective Hausdorff dimension. 171-186 - Szabolcs Mikulás:
Axiomatizability of algebras of binary relations. 187-205 - Ralf Schindler:
Forcing axioms and projective sets of reals. 207-222 - Philip D. Welch:
Post's and other problems of supertasks of higher type. 223-237
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 2025-10-26 23:49 CET 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:
