Pages that link to "Item:Q2817952"
From MaRDI portal
The following pages link to Lower Runtime Bounds for Integer Programs (Q2817952):
Displaying 9 items.
- Lower-bound synthesis using loop specialization and Max-SMT (Q832313) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) (Q2104557) (← links)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Lower Runtime Bounds for Integer Programs (Q2817952) (← links)
- A Calculus for Modular Loop Acceleration (Q5039502) (← links)
