Complexity Theory Retrospective: In Honor of Juris Hartmanis by Alan L. Selman

By Alan L. Selman

In 1965 Juris Hartmanis and Richard E. Stearns released a paper "On the Computational Complexity of Algorithms". the sector of complexity conception takes its identify from this seminal paper and lots of of the foremost thoughts and problems with complexity idea have been brought via Hartmanis in next paintings. In honor of the contribution of Juris Hartmanis to the sphere of complexity idea, a unique consultation of invited talks via Richard E. Stearns, Allan Borodin and Paul younger was once held on the 3rd annual assembly of the constitution in Complexity convention, and the 1st 3 chapters of this publication are the ultimate types of those talks. They remember highbrow tendencies in Hartmanis' contributions. All yet one of many rest of the chapters during this quantity originated as a presentation at one of many fresh conferences of the constitution in Complexity conception convention and seemed in initial shape within the convention complaints. In all, those expositions shape a superb description of a lot of up to date complexity theory.

Show description

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

Similar logic books

Generalized Concavity in Fuzzy Optimization and Decision Analysis (International Series in Operations Research & Management Science)

Convexity of units in linear areas, and concavity and convexity of services, lie on the root of gorgeous theoretical effects that are even as tremendous precious within the research and resolution of optimization difficulties, together with difficulties of both unmarried aim or a number of goals. no longer all of those effects count unavoidably on convexity and concavity; the various effects can be sure that every one neighborhood optimal can also be an international optimal, giving those equipment broader software to a much broader type of difficulties.

Computability and Unsolvability (Dover Books on Computer Science)

During this vintage textual content, Dr. Davis presents a transparent creation to computability, at a sophisticated undergraduate point, that serves the wishes of experts and non-specialists alike. partly One (Chapters 1–5), Professor Davis outlines the overall thought of computability, discussing such issues as computable features, operations on computable services, recursive features, Turing machines, self-applied, and unsolvable selection difficulties.

Elements of Automata Theory

Automata idea lies on the origin of laptop technology, and is essential to a theoretical figuring out of the way desktops paintings and what constitutes formal equipment. This treatise supplies a rigorous account of the subject and illuminates its genuine that means by way of the topic in numerous methods. the 1st a part of the booklet is organised round notions of rationality and recognisability.

Motivic Integration and its Interactions with Model Theory and Non-Archimedean Geometry: Volume 2 (London Mathematical Society Lecture Note Series)

The advance of Maxim Kontsevich's preliminary principles on motivic integration has unexpectedly encouraged many different parts of arithmetic, starting from the Langlands application over harmonic research, to non-Archimedean research, singularity thought and birational geometry. This e-book assembles the various theories of motivic integration and their functions for the 1st time, permitting readers to check various techniques and examine their person strengths.

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

Example text

Download PDF sample

Rated 4.52 of 5 – based on 37 votes