scispace - formally typeset
Search or ask a question

Showing papers by "Juris Hartmanis published in 1989"


Journal ArticleDOI
TL;DR: The Boolean Hierarchy I: Structural Properties explores the structure of the boolean hierarchy, the closure of NP with respect to boolean hierarchies, and the role of symbols in this hierarchy.
Abstract: The Boolean Hierarchy I: Structural Properties [J. Cai et al., SIAM J. Comput ., 17 (1988), pp. 1232–252] explores the structure of the boolean hierarchy, the closure of NP with respect to boolean ...

130 citations


Journal ArticleDOI
TL;DR: After careful examination of the evidence, the Cornell commission publishes its findings in a detailed report that sheds new light and dispels some myths about Robert T. Morris and the Internet worm.
Abstract: After careful examination of the evidence, the Cornell commission publishes its findings in a detailed report that sheds new light and dispels some myths about Robert T. Morris and the Internet worm.

42 citations



BookDOI
01 Jan 1989
TL;DR: Book Descriptive and computational complexity by N. Immerman Complexity issues in cryptography by A. L. Selman Interactive proof systems by S. Goldwasser.
Abstract: Overview of computational complexity theory by J. Hartmanis The isomorphism conjecture and sparse sets by S. R. Mahaney Restricted relativizations of complexity classes by R. V. Book Descriptive and computational complexity by N. Immerman Complexity issues in cryptography by A. L. Selman Interactive proof systems by S. Goldwasser.

8 citations



Proceedings ArticleDOI
19 Jun 1989
TL;DR: The authors determine the Hausdorff dimension and the topological dimension of the graph of K, the Kolmogorov complexity function, and conclude that the complexity graph is a fractal.
Abstract: The authors investigate the Kolmogorov complexity of real numbers. They determine the Hausdorff dimension and the topological dimension of the graph of K, the Kolmogorov complexity function. They conclude that the complexity graph is a fractal. >

2 citations