Skip to main content


eCommons@Cornell

eCommons@Cornell >

Browsing by Author Hartmanis, Juris

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 28 to 47 of 56
< previous   next >
PreviewIssue DateTitleAuthor(s)
Jul-1977On Log-Tape Isomorphisms of Complete SetsHartmanis, Juris
Oct-1983On Non-Isomorphic NP Complete SetsHartmanis, Juris
Dec-1976On Polynomial Time Isomorphism of Complete SetsBerman, L.; Hartmanis, Juris
Jul-1973On Simple Goedel Numberings and TranslationsHartmanis, Juris; Baker, Theodore Paul
Oct-1985On Sparse Oracles Separating Feasible Complexity ClassesHartmanis, Juris; Hemachandra, Lane A.
Aug-1982On Sparse Sets in NP-PHartmanis, Juris
Jan-1989On the Importance of Being II2-HardHartmanis, Juris
Dec-1993On the Intellectual Terrain Around NPHartmanis, Juris; Chari, Suresh
Sep-1974On the Power of Multiplication in Random Access MachinesHartmanis, Juris; Simon, Janos
Jun-1973On the Problem of Finding Natural Computational Complexity MeasuresHartmanis, Juris
Feb-1968On the Recognition of Primes by AutomataHartmanis, Juris; Shank, H.
Mar-1982On the Structure of Feasible ComputationsHartmanis, Juris
Aug-1974On the Structure of Feasible ComputationsHartmanis, Juris; Simon, Janos
Jun-1978On the Succintness of Different Representations of LanguagesHartmanis, Juris
Apr-1970An Overview of the Theory of Computational ComplexityHartmanis, Juris; Hopcroft, John E.
Jun-1968Refinement of Hierarchies of Time Bounded ComputationsHartmanis, Juris; Hopcroft, John E.
Jun-1977Relations Between Diagonalization, Proof Systems, and Complexity GapsHartmanis, Juris
Mar-1977Relations Between Diagonalization, Proof Systems, and Complexity GapsHartmanis, Juris
Aug-1978Relative Succinctness of Representations of Languages and Separation of Complexity ClassesHartmanis, Juris
Aug-1970Size Arguments in the Study of Computation SpeedsHartmanis, Juris
Showing results 28 to 47 of 56
< previous   next >

 

© 2014 Cornell University Library Contact Us