Open Access
The LBA Problem and its Importance in the Theory of Computing
Juris Hartmanis,Harry B. Hunt +1 more
About:
The article was published on 1973-05-01 and is currently open access. It has received 42 citations till now.read more
Citations
More filters
Book
Structural Complexity I
TL;DR: This volume is written for undergraduate students who have taken a first course in Formal Language Theory and presents the basic concepts of structural complexity, thus providing the background necessary for the understanding of complexity theory.
Journal ArticleDOI
On Relating Time and Space to Size and Depth
TL;DR: Turing machine space complexity is related to circuit depth complexity, which complements the known connection between Turing machine time and circuit size, thus enabling the related nature of some important open problems concerning Turing machine and circuit complexity to be exposed.
Logic and the Challenge of Computer Science
TL;DR: In this paper, the authors consider the question whether there exists a logic that captures polynomial time (without presuming the presence of a linear order) and conjecture the negative answer.
Proceedings ArticleDOI
On isomorphisms and density of NP and other complete sets
Juris Hartmanis,Leonard Berman +1 more
TL;DR: It is shown that complete sets in EXPTIME and EXPTAPE cannot be sparse and therefore they cannot be over a single letter alphabet, and the hardest context-sensitive languages cannot been sparse.
Journal ArticleDOI
A very hard log-space counting class
Carme Àlvarez,Birgit Jenner +1 more
TL;DR: It is demonstrated that span-L functions can be computed in polynomial time if and only if P (#P) and all the classes of the polynometric-time hierarchy are included in P.