Structural Complexity I

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

In the six years since the first edition of this book was published, the field of Structural Complexity has grown quite a bit. However, we are keeping this volume at the same basic level that it had in the first edition, and the only new result incorporated as an appendix is the closure under complementation of nondeterministic space classes, which in the previous edition was posed as an open problem. This result was already included in our Volume II, but we feel that due to the basic nature of the result, it belongs to this volume. There are of course other important results obtained during these last six years. However, as they belong to new areas opened in the field they are outside the scope of this fundamental volume. Other changes in this second edition are the update of some Bibliograph­ ical Remarks and references, correction of many mistakes and typos, and a renumbering of the definitions and results. Experience has shown us that this new numbering is a lot more friendly, and several readers have confirmed this opinion. For the sake of the reader of Volume II, where all references to Volume I follow the old numbering, we have included here a table indicating the new number corresponding to each of the old ones.

Author(s): José Luis Balcázar, Josep Díaz, Joaquim Gabarró
Series: Texts in Theoretical Computer Science. An EATCS Series
Edition: 2nd
Publisher: Springer
Year: 1995

Language: English
Commentary: Originally published as volume 11 in the series: EATCS Monographs on Theoretical Computer Science
Pages: 222
Tags: Algorithm Analysis and Problem Complexity; Computational Mathematics and Numerical Analysis; Computation by Abstract Devices; Mathematical Logic and Foundations

Front Matter....Pages I-XIII
Introduction....Pages 1-5
Basic Notions About Models of Computation....Pages 6-35
Time and Space Bounded Computations....Pages 36-58
Central Complexity Classes....Pages 59-86
Time Bounded Turing Reducibilities....Pages 87-103
Nonuniform Complexity....Pages 104-135
Probabilistic Algorithms....Pages 136-156
Uniform Diagonalization....Pages 157-167
The Polynomial Time Hierarchy....Pages 168-185
Back Matter....Pages 186-210