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.
Complexity Theory Retrospective
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
As complexity theory has developed over the years, it is clear that the field has gone through definite stages and has passed through a number of trends and styles of research. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
recursion theoretic results, color class size, collapsing degrees, time programming systems, relativization results, padding functions, transitive subtournament, isomorphism conjecture, mogorov complexity, scrambling functions, sparse oracles, time isomorphic, structural complexity theory, crossing sequence, oracle relative, logspace reductions, sparse complete, red vertex, counting quantifiers, recursion theorem, nondeterministic space, pushdown stores, computational complexity theory, ordered graphs, partial recursive functions Key Phrases - Capitalized Phrases (CAPs): (learn more)
Juris Hartmanis, Technical Report, Springer Verlag, Lecture Notes, Theor Comput Sci, Annual Structure, Neil Immerman, Systems Sci, New York, University of Wisconsin, Assoc Comput Mach, Isomorphism Theorem, Proof Sketch of Theorem, Symbolic Logic, Symp Theory Comput, University of Chicago, Comput System Sci, Cornell University, Harvard University, Jamming Lemma, American Mathematical Society, Applied Math, Kansas City, Lane Hemachandra, Math Systems Theory New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
As complexity theory has developed over the years, it is clear that the field has gone through definite stages and has passed through a number of trends and styles of research. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
recursion theoretic results, color class size, collapsing degrees, time programming systems, relativization results, padding functions, transitive subtournament, isomorphism conjecture, mogorov complexity, scrambling functions, sparse oracles, time isomorphic, structural complexity theory, crossing sequence, oracle relative, logspace reductions, sparse complete, red vertex, counting quantifiers, recursion theorem, nondeterministic space, pushdown stores, computational complexity theory, ordered graphs, partial recursive functions Key Phrases - Capitalized Phrases (CAPs): (learn more)
Juris Hartmanis, Technical Report, Springer Verlag, Lecture Notes, Theor Comput Sci, Annual Structure, Neil Immerman, Systems Sci, New York, University of Wisconsin, Assoc Comput Mach, Isomorphism Theorem, Proof Sketch of Theorem, Symbolic Logic, Symp Theory Comput, University of Chicago, Comput System Sci, Cornell University, Harvard University, Jamming Lemma, American Mathematical Society, Applied Math, Kansas City, Lane Hemachandra, Math Systems Theory New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 23
books:
See all 23 books this book cites
1
book
cites this book:
- Structure in Complexity Theory (Lecture Notes in Computer Science) by Alan L. Selman on 6 pages
- Computational Complexity Theory (Proceedings of Symposia in Applied Mathematics) by Juris Hartmanis on 5 pages
- Computer Science: A Modern Introduction (Prentice-Hall International Series in Computer Science) by Les Goldschlager on page 26, page 80, and Back Matter
- Theoretical Computer Science: Essays in Memory of Shimon Even (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) by Oded Goldreich on page 143, and page 144
- Computational Complexity (Mathematics and its Applications) by K. Wagner on page 58, and page 107
See all 23 books this book cites
- The World According to Wavelets: The Story of a Mathematical Technique in the Making, Second Edition by Barbara Burke Hubbard in Back Matter
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
