J
Juris Hartmanis
Researcher at Cornell University
Publications - 171
Citations - 10901
Juris Hartmanis is an academic researcher from Cornell University. The author has contributed to research in topics: Structural complexity theory & Computational complexity theory. The author has an hindex of 46, co-authored 171 publications receiving 10705 citations. Previous affiliations of Juris Hartmanis include National Research Council & General Electric.
Papers
More filters
Journal ArticleDOI
The Boolean hierarchy II: applications
Jin-Yi Cai,Thomas Gundermann,Gerd Wechsung,Juris Hartmanis,Lane A. Hemachandra,Vivian Sewelson,Klaus W. Wagner +6 more
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.
Journal ArticleDOI
On non-determinancy in simple computing devices
TL;DR: The main result shows that if any set accepted by such a 3-head non-deterministic Turing machine can be accepted by a deterministic Turing Machine with more read-only heads, then the deterministic and non-Deterministic context-sensitive languages are identical.
BookDOI
The World Wide Web and Databases
TL;DR: The name Quilt suggests both the way in which features from several languages were assembled to make a new query language, and theway in which Quilt queries can combine information from diverse data sources into a query result with a new structure of its own.
Journal ArticleDOI
Sparse sets in NP-P: EXPTIME versus NEXPTIME*
TL;DR: The paper exploits the recently discovered upward separation method and uses relativization techniques to determine logical possibilities, limitations of these proof techniques, and exhibits one of the first natural structural differences between relativized NP and CoNP.
Proceedings ArticleDOI
On the power of multiplication in random access machines
Juris Hartmanis,Janos Simon +1 more
TL;DR: It is proved that, counting one operation as a unit of time and considering the machines as acceptors, deterministic and nondeterministic polynomial time acceptable languages are the same, and are exactly the languages recognizable in polynomially tape by Turing machines.