This is the second volume of a systematic two-volume presentation of the various areas of research in the field of structural complexity. The mathematical theory of computation has developed into a broad and rich discipline within which the theory of algorithmic complexity can be approached from several points of view. This volume is addressed to graduate students and researchers and assumes knowledge of the topics treated in the first volume but is otherwise nearly self-contained. Topics covered include vector machines, parallel computation, alternation, uniform circuit complexity, isomorphism, biimmunity and complexity cores, relativization and positive relativization, the low and high hierarchies, Kolmogorov complexity and probability classes. Numerous exercises and references are given.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
This is the second volume of a systematic two-volume presentation of the various areas of research in the field of structural complexity. The mathematical theory of computation has developed into a broad and rich discipline within which the theory of algorithmic complexity can be approached from several points of view. This volume is addressed to graduate students and researchers and assumes knowledge of the topics treated in the first volume but is otherwise nearly self-contained. Topics covered include vector machines, parallel computation, alternation, uniform circuit complexity, isomorphism, biimmunity and complexity cores, relativization and positive relativization, the low and high hierarchies, Kolmogorov complexity and probability classes. Numerous exercises and references are given.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 6,80 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: Bulrushed Books, Moscow, ID, Estados Unidos de America
Condición: Good. LIGHTNING FAST SHIPPING! Text In Good condition- Has Used Stickers, pages may have marks and notes throughout and on edges Binding solid. Ships Fast! Nº de ref. del artículo: #174D-00138
Cantidad disponible: 1 disponibles
Librería: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Alemania
Hardcover. 283 p. Good condition. The pages are clean and without markings. Slight signs of storage and use. Retired library copy with corresponding markings. Otherwise, a neat copy. 9783540520795 Sprache: Englisch Gewicht in Gramm: 1000. Nº de ref. del artículo: 317991
Cantidad disponible: 3 disponibles