Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Hemmerling, Armin"'
Autor:
Hemmerling, Armin
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 infinite hierarchy of proper subclasses DTIME_b(f) \subset \DTIME(f).
Externí odkaz:
http://arxiv.org/abs/1309.7457
Autor:
Hemmerling, Armin
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 bounds whose regular subsets allow to represent several time complexity
Externí odkaz:
http://arxiv.org/abs/1309.5862
Autor:
Hemmerling, Armin
Publikováno v:
In Electronic Notes in Theoretical Computer Science 3 February 2005 120:59-72
Autor:
Hemmerling, Armin1 hemmerli@uni-greifswald.de
Publikováno v:
Mathematical Logic Quarterly. May2015, Vol. 61 Issue 3, p127-131. 5p.
Autor:
Hemmerling, Armin1 hemmerli@uni-greifswald.de
Publikováno v:
Archive for Mathematical Logic. Mar2006, Vol. 45 Issue 3, p323-350. 28p.
Autor:
Hemmerling, Armin1 hemmerli@uni-greifswald.de
Publikováno v:
Mathematical Logic Quarterly. Sep2004, Vol. 50 Issue 4/5, p507-519. 13p.