Complexity Theory Retrospective
Kurzinformation
inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar
Beschreibung
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.
Produktdetails
So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
- Hardcover
- 252 Seiten
- Erschienen 2008
- Springer Berlin Heidelberg
- hardcover
- 328 Seiten
- Erschienen 2013
- Wiley-VCH
- Hardcover
- 528 Seiten
- Erschienen 2000
- Springer
- Hardcover -
- Erschienen 2009
- Cambridge University Pr.
- Hardcover
- 288 Seiten
- Erschienen 2007
- Princeton University Press
- Taschenbuch
- 248 Seiten
- Erschienen 2000
- Stanford University Press
- Hardcover
- 392 Seiten
- Erschienen 2015
- Wiley
- Hardcover
- 432 Seiten
- Erschienen 2008
- Cambridge University Press
- Hardcover
- 472 Seiten
- Erschienen 1997
- Springer