Complexity in Mathematics and Computer Science
The proceedings volume appeared in the series TRENDS IN LOGIC:
Benedikt Löwe, Boris Piwinger, Thoralf Räsch (eds.), Classical and New Paradigms of Computation and their Complexity Hierarchies, Papers of the conference "Foundations of the Formal Sciences III" held in Vienna, September 21-24, 2001, Kluwer Academic Publishers, Dordrecht 2004 [Trends in Logic, Volume 23] |
Author | Title | Received | Status |
---|---|---|---|
Benedikt Löwe | Complexity Hierarchies derived from reduction functions (p.1-14) | ||
Andris Ambainis | Quantum query algorithms and lower bounds (p.15-32) | November 25th, 2001; Revised: March 12th, 2002 | Accepted; Final Version |
Markus Bläser | Algebras of minimal rank: Overview and Recent Developments (p.33-46) | November 21st, 2001 | Accepted; Final Version |
Jörg Brendle | Recent Developments in Iterated Forcing Theory (p.47-60) | November 12th, 2001; Revised: February 28th, 2002 | Accepted; Final Version |
Riccardo Camerlo | Classification problems in analysis and topology (p.61-75) | November 5th, 2001; Revised: March 30th, 2002 | Accepted; Final Version |
Lars Engebretsen | Using Easy Optimization Problems To Solve Hard Ones (p.77-93) | November 14th, 2001; Revised: February 22nd, 2002 | Accepted; Final Version |
Stefan Geschke, Sandra Quickert | On Sacks forcing and the Sacks property (p.95-139) | November 23rd, 2001; Revised: May 8th, 2002, January 26th, 2003, June 2nd, 2003 | Accepted; Final Version |
Joel David Hamkins | Supertask Computations (p.141-158) | November 19th, 2001; Revised: February 9th, 2002 | Accepted; Final Version |
Peter Koepke, Marc van Eijmeren | Refinements of the constructible hierarchy (p.159-169) | December 20th, 2001; Revised: March 11th, 2003, November 5th, 2003 | Accepted; Final Version |
Elvira Mayordomo Camara | Effective Hausdorff dimension (p.171-186) | November 23rd, 2001; Revised: March 27th, 2002, June 5th, 2002 | Accepted; Final Version |
Szabolcs Mikulas | Axiomatizability of algebras of binary relations (p.187-205) | November 23rd, 2001; Revised: March 6th, 2002, April 29th, 2002 | Accepted; Final Version |
Ralf-Dieter Schindler | Forcing Axioms and Projective Sets of Reals (p.207-222) | October 4th, 2001; Revised: February 22nd, 2002 | Accepted; Final Version |
Philip D. Welch | Determinacy and Post's Problem for Infinite Time Turing Machines (p.223-237) | December 10th, 2001; Revised: March 18th, 2002 | Accepted; Final Version |