Juris Hartmanis is a pioneer of complexity theory. This Festschrift recalls his work and reviews the current state of the theory.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Book by None
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 intro. Codice articolo 4191349
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 248 pp. Englisch. Codice articolo 9781461287933
Quantità: 2 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9781461287933
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781461287933_new
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 248 pp. Englisch. Codice articolo 9781461287933
Quantità: 2 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 384. Codice articolo C9781461287933
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 248. Codice articolo 2648037823
Quantità: 4 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. reprint edition. 234 pages. 9.00x6.00x0.50 inches. In Stock. Codice articolo x-1461287936
Quantità: 2 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Mar2716030030025
Quantità: Più di 20 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 248 6 Figures, 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Codice articolo 44777568
Quantità: 4 disponibili