Readers of Complexity Theory Retrospective (published by Springer-Verlag in 1990) will remember that the collection consisted primarily of articles that first ap- peared in preliminary form at one of the meetings of the Annual IEEE Conference on Structure in Complexity Theory. In particular, Complexity Theory Retrospective contained final versions of high-quality technical expository presentations, includ- ing talks that honored Juris Hartmanis on the occasion of his sixtieth birthday. We began planning for the current collection some months before the scheduled meeting in 1994 of the Tenth...
Readers of Complexity Theory Retrospective (published by Springer-Verlag in 1990) will remember that the collection consisted primarily of articles th...
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...
In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms." The field of complexity theory takes...
On May 1, 2004, the world of theoretical computer science su?ered a stunning loss: Shimon Even passed away. Few computer scientists have had as long, s- tained, and in?uential a career as Shimon. Shimon Even was born in Tel-Aviv in 1935. He received a B.Sc. in Elect- cal Engineering from the Technion in 1959, an M.A. in Mathematics from the University of Northern Carolina in 1961, and a Ph.D. in Applied Mathematics from Harvard University in 1963. He held positions at the Technion (1964 67 and 1974 2003), Harvard University (1967 69), the Weizmann Institute (1969 74), and the Tel-Aviv...
On May 1, 2004, the world of theoretical computer science su?ered a stunning loss: Shimon Even passed away. Few computer scientists have had as long, ...
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...
In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms." The field of complexity theory takes...
This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to research. The editors'aim has been to provide an accessible description of the current stae of complexity theory, and to demonstrate the breadth of techniques and results that make this subject so exciting. Thus, papers run the gamut from sublogarithmic space to exponential time, and from new combinatorial techniques to interactive proof systems.
This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide ...