Tighter constant-factor time hierarchies

Authors:
Amir M. Ben-Amram
Affiliations:
The Academic College of Tel-Aviv Yaffo, Tel-Aviv, Israel
Venue:
Information Processing Letters
Year:
2003

Citing 4
Cited 0

Constant time factors do matter

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A precise version of a time hierarchy theorem

Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Computational complexity via programming languages: constant factors do matter

Acta Informatica
Linear Time Hierarchies for a Functional Language Machine Model

ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

For certain computational models, a constant-factor time hierarchy theorem is known, showing that a constant-factor difference in time bounds makes a difference in problem-solving power (unlike the situation with Turing machines). In this paper we apply the classic "translational technique" (padding) to these hierarchies and show that they are tighter than indicated by the previous proofs.