Computational complexity via programming languages: Constant factors do matter

DOI10.1007/s002360000038zbMath0960.68079OpenAlexW2063329952MaRDI QIDQ1587302

Amir M. Ben-Amram, Neil D. Jones

Publication date: 7 December 2000

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360000038

zbMATH Keywords

complexitycomputabilityprogramming-languagetime hierarchy theorems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of programming languages (68N15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Graph properties checkable in linear time in the number of vertices ⋮ Tighter constant-factor time hierarchies ⋮ Automated higher-order complexity analysis

Uses Software

• LISP

This page was built for publication: Computational complexity via programming languages: Constant factors do matter