Juris Hartmanis
Cornell University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Juris Hartmanis.
SIAM Journal on Computing | 1977
Leonard Berman; Juris Hartmanis
If all
SIAM Journal on Computing | 1988
Jin-Yi Cai; Thomas Gundermann; Juris Hartmanis; Lane A. Hemachandra; Vivian Sewelson; Klaus W. Wagner; Gerd Wechsung
NP
Archive | 1980
Gerhard Goos; Juris Hartmanis; W. Brauer; P. Brinch Hansen; David Gries; C. Moler; G. Seegmüller; J. Stoer; Niklaus Wirth
complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then
Ire Transactions on Electronic Computers | 1961
Richard Edwin Stearns; Juris Hartmanis
P \ne NP
foundations of computer science | 1983
Juris Hartmanis
and if all PTAPE complete sets are P-isomorphic then
Journal of the ACM | 1971
Juris Hartmanis; John E. Hopcroft
P \ne {\text{PTAPE}}
Archive | 2001
Gerhard Goos; Juris Hartmanis; Jan van Leeuwen; Dan Suciu; Gottfried Vossen
. We show that all
SIAM Journal on Computing | 1989
Jin-Yi Cai; Thomas Gundermann; Gerd Wechsung; Juris Hartmanis; Lane A. Hemachandra; Vivian Sewelson; Klaus W. Wagner
NP
Information & Computation | 1985
Juris Hartmanis; Neil Immerman; Vivian Sewelson
complete sets known (in the literature) are indeed p-isomorphic and so are the known PTAPE complete sets. This shows that, in spite of the radically different origins and attempted simplification of these sets, all the known
Theoretical Computer Science | 1984
Juris Hartmanis; Yaacov Yesha
NP
