Tight worst-case bounds for polynomial loop programs

DOI10.1007/978-3-030-17127-8_5OpenAlexW2932840932MaRDI QIDQ2289065

Geoff W. Hamilton, Amir M. Ben-Amram

Publication date: 28 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17127-8_5

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (4)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Algorithmically broad languages for polynomial time and space ⋮ Unnamed Item ⋮ Type-based analysis of logarithmic amortised complexity

This page was built for publication: Tight worst-case bounds for polynomial loop programs