Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of his Sixtieth Birthday, July 5, 1988 by Alan L. SelmanComplexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of his Sixtieth Birthday, July 5, 1988 by Alan L. Selman

Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of his Sixtieth…

EditorAlan L. Selman

Hardcover | June 26, 1990

Pricing and Purchase Info

$245.95 online 
$258.95 list price save 5%
Earn 1,230 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of his Sixtieth…Format:HardcoverDimensions:258 pages, 9.21 × 6.14 × 0 inPublished:June 26, 1990Publisher:Springer New York

The following ISBNs are associated with this title:

ISBN - 10:0387973508

ISBN - 13:9780387973500

Reviews

Table of Contents

Contents: Introduction.- Juris Hartmanis: The Beginnings of Computational Complexity.- Juris Hartmanis: Building a Department-Building a Discipline.- Juris Hartmanis: Fundamental Contributions to Isomorphism Problems.- Describing Graphs: A First-Order Approach to Graph Canonization.- Self-Reducibility; Effects of Internal Structure on Computational Complexity.- The Structure of Complete Degrees.- Applications of Kolmogorov Complexity in the Theory of Computation.- The Power of Counting.