Pages that link to "Item:Q2164209"
From MaRDI portal
The following pages link to Non-polynomial worst-case analysis of recursive programs (Q2164209):
Displaying 10 items.
- ATLAS: automated amortised complexity analysis of self-adjusting data structures (Q832253) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- Beyond the Worst-Case Analysis of Algorithms (Q5118515) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- Type-based analysis of logarithmic amortised complexity (Q5875895) (← links)
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs (Q6487312) (← links)
- Affine Loop Invariant Generation via Matrix Algebra (Q6487319) (← links)
- MDPs as distribution transformers: affine invariant synthesis for safety objectives (Q6535681) (← links)