@inproceedings{10.1145/800070.802172,
Abstract = {Let k be a constant ≥ 2, and let us consider only deterministic k-tape Turing machines.We assume t2(n) \> n and t2 is computable in time t2. Then there is a language which is accepted in time t2, but not accepted in any time t1 with t1(n) = o(t2(n)).Furthermore, we obtain a strong hierarchy (isomorphic to the rationals Q) for languages accepted in fixed space and variable time.},
Address = {New York, NY, USA},
Author = {F\"{u}rer, Martin},
BookTitle = {Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing},
File = {The tight deterministic time hierarchy - 10.1145@800070.802172.pdf},
ISBN = {0897910702},
Location = {San Francisco, California, USA},
Pages = {8--16},
Publisher = {Association for Computing Machinery},
Series = {STOC '82},
Title = {The Tight Deterministic Time Hierarchy},
URL = {https://doi.org/10.1145/800070.802172},
Year = {1982},
bdsk-url-1 = {https://doi.org/10.1145/800070.802172},
date-added = {2021-11-04 16:01:31 +0100},
date-modified = {2021-11-04 16:01:31 +0100},
numpages = {9},
doi = {10.1145/800070.802172}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A