Box 9
Contains 88 Results:
Independence Results About Context-Free Languages and Lower Bounds, 1985
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Pragmatic Aspects of Complexity Theory, 1986
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
The Boolean Hierarchy I: Structural Properties, 1988
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
The Boolean Hierarchy II: Applications, 1988
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Complexity Classes Without Machines: On Complete Languages for Up, 1988
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
On Sparse Oracles Separating Feasible Complexity Classes, 1988
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
On the Importance of Being π2 - Hard, 1989
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Gödel, von Neumann, and the P = ?NP Problem, 1989
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Overview of Computational Complexity Theory, 1989
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Robust Machines Accept Easy Sets, 1990
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.