Classical and new paradigms of computation and their complexity hierarchies : papers of the conference "Founda | Löwe, Benedikt, Piwinger, Boris, Räsch, Thoralf
Share on TelegramClassical and new paradigms of computation and their complexity hierarchies : papers of the conference "Founda
Author: Löwe, Benedikt, Piwinger, Boris, Räsch, Thoralf
Added by: sketch
Added Date: 2015-12-29
Publication Date: 2004
Language: eng
Subjects: Computational complexity, Functions of complex variables, Complexiteit, Recursie, Algoritmen, Complexity hierarchies, Formal sciences
Publishers: Dordrecht ; Boston : Kluwer Academic Publishers
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 1402027753, 9781402027758
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 132.46 MB
PDF Size: 3.54 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 423
Views: 473
Total Files: 18
Media Type: texts
Description
Author: Benedikt Löwe, Boris Piwinger, Thoralf Räsch
Published by Springer Netherlands
ISBN: 978-1-4020-2775-8
DOI: 10.1007/978-1-4020-2776-5
Table of Contents:
- Complexity hierarchies derived from reduction functions
- Quantum query algorithms and lower bounds
- Algebras of minimal rank: overview and recent developments
- Recent developments in iterated forcing theory
- Classification problems in algebra and topology
- Using easy optimization problems to solve hard ones
- On Sacks forcing and the Sacks property
- Supertask computation
- A refinement of Jensen's constructible hierarchy
- Effective Hausdorff dimension
- Axiomatizability of algebras of binary relations
- Forcing axioms and projective sets of reals
- Post's and other problems of supertasks of higher type
Includes bibliographical references (p. [239]-257)