1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2013★ 1 cited
On the Tape-Number Problem for Deterministic Time Classes
Armin Hemmerling
For any time bound f, let H(f) denote the hierarchy conjecture which means that the restriction of the numbers of work tapes of deterministic Turing machines to some b generates an…
cs.CC2013
On Regular Sets of Bounds and Determinism versus Nondeterminism
Armin Hemmerling
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of b…