scientific article; zbMATH DE number 7471667

MaRDI QIDQ5028427

Geoff W. Hamilton, Amir M. Ben-Amram

Publication date: 9 February 2022

Full work available at URL: https://arxiv.org/abs/2010.02823

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

multivariateworst-casepolynomial boundsasymptotically-tight

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of time complexity by simple loop programs
• On the computational complexity of imperative programming languages
• Termination of polynomial loops
• Tight worst-case bounds for polynomial loop programs
• Computing polynomial program invariants
• Complexity and resource bound analysis of imperative programs using difference constraints
• A flow calculus of mwp -bounds for complexity analysis
• Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
• Mechanical program analysis
• ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS
• Computer Aided Verification
• Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
• Termination of Integer Linear Programs

This page was built for publication: