Tighter constant-factor time hierarchies

DOI10.1016/S0020-0190(03)00253-9zbMath1175.68157MaRDI QIDQ1014389

Amir M. Ben-Amram

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexityhierarchy theorempadding argument

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity via programming languages: Constant factors do matter
• On Families of Languages Defined by Time-Bounded Random Access Machines
• Constant time factors do matter

This page was built for publication: Tighter constant-factor time hierarchies