|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Alan L. SelmanPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: 1990 ed. Dimensions: Width: 15.60cm , Height: 1.50cm , Length: 23.40cm Weight: 1.160kg ISBN: 9780387973500ISBN 10: 0387973508 Pages: 234 Publication Date: 26 June 1990 Audience: General/trade , Professional and scholarly , General , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents0 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |