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 - researchr publication

researchr

You are not signed in
Sign in
Sign up

Benedikt Löwe, Boris Piwinger, Thoralf Räsch, editors, 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. Volume 23 of Trends in Logic, Springer, 2004. [doi]

Conference: fotfs2004

Abstract is missing.

Complexity hierarchies derived from reduction functionsBenedikt Löwe. 1-14 [doi]

Quantum query algorithms and lower boundsAndris Ambainis. 15-32 [doi]

Algebras of minimal rank: overview and recent developmentsMarkus Bläser. 33-46 [doi]

Recent developments in iterated forcing theoryJörg Brendle. 47-60 [doi]

Classification problems in algebra and topologyRiccardo Camerlo. 61-75 [doi]

Using easy optimization problems to solve hard onesLars Engebretsen. 77-93 [doi]

On Sacks forcing and the Sacks propertyStefan Geschke, Sandra Quickert. 95-139 [doi]

Supertask computationJoel David Hamkins. 141-158 [doi]

A refinement of Jensen's constructible hierarchyPeter Koepke, Marc van Eijmeren. 159-169 [doi]

Effective Hausdorff dimensionElvira Mayordomo Cámara. 171-186 [doi]

Axiomatizability of algebras of binary relationsSzabolcs Mikulás. 187-205 [doi]

Forcing axioms and projective sets of realsRalf Schindler. 207-222 [doi]

Post's and other problems of supertasks of higher typePhilip D. Welch. 223-237 [doi]

runs on WebDSL