Complexity Theory Retrospective

1. Front Matter

   Pages i-x

   PDF

2. Introduction

   • Alan L. Selman

   Pages 1-4

3. Juris Hartmanis: The Beginnings of Computational Complexity

   • Richard E. Stearns

   Pages 5-18

4. Juris Hartmanis: Building a Department—Building a Discipline

   • Allan Borodin

   Pages 19-27

5. Juris Hartmanis: Fundamental Contributions to Isomorphism Problems

   • Paul Young

   Pages 28-58

6. Describing Graphs: A First-Order Approach to Graph Canonization

   • Neil Immerman, Eric Lander

   Pages 59-81

7. Self-Reducibility: Effects of Internal Structure on Computational Complexity

   • Deborah Joseph, Paul Young

   Pages 82-107

8. The Structure of Complete Degrees

   • Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

   Pages 108-146

9. Applications of Kolmogorov Complexity in the Theory of Computation

   • Ming Li, Paul M. B. Vitányi

   Pages 147-203

10. The Power of Counting

    • Uwe Schöning

    Pages 204-223

11. Back Matter

    Pages 225-234

    PDF

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.

• Counting
• algorithm
• algorithms
• complexity
• complexity theory
• theory of computation
• algorithm analysis and problem complexity

• College of Computer Science, Northeastern University, Boston, USA

  Alan L. Selman

Policies and ethics