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

Author:   Alan L. Selman
Publisher:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1990
ISBN:  

9781461287933


Pages:   234
Publication Date:   12 November 2011
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $290.37 Quantity:  
Add to Cart

Share |

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


Add your own review!

Overview

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.

Full Product Details

Author:   Alan L. Selman
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1990
Dimensions:   Width: 15.50cm , Height: 1.30cm , Length: 23.50cm
Weight:   0.382kg
ISBN:  

9781461287933


ISBN 10:   1461287936
Pages:   234
Publication Date:   12 November 2011
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

0 Introduction.- 1 Juris Hartmanis: The Beginnings of Computational Complexity.- 2 Juris Hartmanis: Building a Department—Building a Discipline.- 3 Juris Hartmanis: Fundamental Contributions to Isomorphism Problems.- 4 Describing Graphs: A First-Order Approach to Graph Canonization.- 5 Self-Reducibility: Effects of Internal Structure on Computational Complexity.- 6 The Structure of Complete Degrees.- 7 Applications of Kolmogorov Complexity in the Theory of Computation.- 8 The Power of Counting.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List