Tighter constant-factor time hierarchies
type: Item
instance of: scholarly article
title: Tighter constant-factor time hierarchies
zbMATH Open document ID: 1175.68157
DOI: 10.1016/S0020-0190(03)00253-9
author: Amir M. Ben-Amram
published in: Information Processing Letters
publication date: 2009-04-28T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5547775
zbMATH Keywords: computational complexity
zbMATH Keywords: hierarchy theorem
zbMATH Keywords: padding argument
MaRDI profile type: Publication
cites work: Q4349101
cites work: Computational complexity via programming languages: Constant factors do matter
cites work: Q4265618
cites work: Constant time factors do matter
cites work: Q5672171
cites work: On Families of Languages Defined by Time-Bounded Random Access Machines
Recommended article: Time-Dependent Contraction Hierarchies
Recommended article: Fundamentals of Computation Theory
Recommended article: Q3343441
Recommended article: Q3476799
Recommended article: Q4265618
Recommended article: Hierarchical Time-Dependent Oracles
Recommended article: The Effect of Time Constraints on Scaled Speedup
description: scientific article; zbMATH DE number 5547775