Alan L. Selman – författare

Complexity theory has been a flourishing area of research in the last ten years and currently provides one of the most active subjects for future research problems in computer science. This volume provides a survey of the subject in the form of a collection of articles written by experts that to- gether provide a comprehensive guide to research. The editors' aim has been to provide an accessible description of the current state of complexity theory,and to demonstrate the breadth of techniques and results that make the subject exciting. Thus, papers run the gamut from sublogarithmic space to exponential time and from new combinatorial techniques to interactive proof systems. As a result, researchers in computer science will find this an excellent starting point for study in the subject and a useful source of the key results known.

In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms". The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis' contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory.

Readers of Complexity Theory Retrospective (published by Springer-Verlag in 1990) will remember that the collection consisted primarily of articles that first ap­ peared in preliminary form at one of the meetings of the Annual IEEE Conference on Structure in Complexity Theory. In particular, Complexity Theory Retrospective contained final versions of high-quality technical expository presentations, includ­ ing talks that honored Juris Hartmanis on the occasion of his sixtieth birthday. We began planning for the current collection some months before the scheduled meeting in 1994 of the Tenth Annual IEEE Conference on Structure in Complexity Theory. As with the original volume, several of the papers in this book originated as presentations at one of the meetings of the Structure in Complexity Theory con­ ference. We are pleased to provide this forum for final, polished versions of these papers. As it turns out, 1994 was a watershed year for the Structures conference, for at this meeting the conference attendees voted to change the conference name to its current name, the Annual IEEE Conference on Computational Complex­ ity. In voting to remove the expression "Structure in," the conferees recognized the recent explosion of techniques and results in computational complexity, and expressed concern that the original conference name might not accurately reflect the current status. We approached this volume in the same spirit.

In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms". The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis' contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory.

This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.

This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.