Structural Complexity II

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"

This is the second volume of a two volume collection on Structural Complexity. This volume assumes as a prerequisite knowledge about the topics treated in Volume I, but the present volume itself is nearly self-contained. As in Volume I, each chapter of this book ends with a section entitled "Bibliographical Remarks", in which the relevant references for the chapter are briefly commented upon. These sections might also be of interest to those wanting an overview of the evolution of the field, as well as relevant related results which are not included in the text. Each chapter includes a section of exercises. The reader is encouraged to spend some time on them. Some results presented as exercises are occasionally used later in the text. A reference is provided for the most interesting and for the most useful exercises. Some exercises are marked with a • to indicate that, to the best knowledge of the authors, the solution has a certain degree of difficulty. Many topics from the field of Structural Complexity are not treated in depth, or not treated at all. The authors bear all responsibility for the choice of topics, which has been made based on the interest of the authors on each topic. Many friends and colleagues have made suggestions or corrections. In partic­ ular we would like to express our gratitude to Richard Beigel, Ron Book, Rafael Casas, Jozef Gruska, Uwe Schoning, Pekka Orponen, and Osamu Watanabe.

Author(s): José Luis Balcázar, Josep Díaz, Joaquim Gabarró
Series: EATCS Monographs on Theoretical Computer Science Series 22
Publisher: Springer
Year: 1990

Language: English
Pages: 294
Tags: Computation by Abstract Devices; Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Mathematical Logic and Foundations

Front Matter....Pages I-IX
Introduction....Pages 1-3
Vector Machines....Pages 4-32
The Parallel Computation Thesis....Pages 33-62
Alternation....Pages 63-96
Uniform Circuit Complexity....Pages 97-118
Isomorphism and NP -completeness....Pages 119-133
Bi-Immunity and Complexity Cores....Pages 134-148
Relativization....Pages 149-177
Positive Relativizations....Pages 178-198
The Low and the High Hierarchies....Pages 199-218
Resource-Bounded Kolmogorov Complexity....Pages 219-234
Probability Classes and Proof-Systems....Pages 235-256
Back Matter....Pages 257-285