Cover Image

Complexity Theory Retrospective : In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988 /

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Selman, Alan L.
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: New York, NY : Springer New York, 1990.
Subjects:
Computer science.
Computer software.
Logic, Symbolic and mathematical.
Electronic books.
Online Access:Connect to the full text of this electronic book
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.