Computational complexity via programming languages: Constant factors do matter

DOI10.1007/S002360000038MaRDI QIDQ1587302zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 2110614
• scientific article; zbMATH DE number 1339873
• Programming languages capturing complexity classes
• scientific article; zbMATH DE number 1339956
• scientific article; zbMATH DE number 1405577

Cited in

(9)

• Tighter constant-factor time hierarchies
• Automated higher-order complexity analysis
• scientific article; zbMATH DE number 5117088 (Why is no real title available?)
• scientific article; zbMATH DE number 1339873 (Why is no real title available?)
• scientific article; zbMATH DE number 1339956 (Why is no real title available?)
• scientific article; zbMATH DE number 2110614 (Why is no real title available?)
• scientific article; zbMATH DE number 1405577 (Why is no real title available?)
• Graph properties checkable in linear time in the number of vertices
• Program specialization as a tool for solving word equations

Describes a project that uses

Uses Software

• LISP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587302)