Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata
Abstract elided by the publisher.
Related papers
- Efficient Synthesis of Tight Polynomial Upper-Bounds for Systems of Conditional Polynomial Recurrences ESOP 2025
- Raising expectations: automating expected cost analysis with types ICFP 2020
- A pre-expectation calculus for probabilistic sensitivity POPL 2021
- Finding Provably Optimal Markov Chains TACAS 2021
- Quantum Probabilistic Model Checking for Time-Bounded Properties OOPSLA 2024
- Central moment analysis for cost accumulators in probabilistic programs PLDI 2021
- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration TACAS 2023
- The strength of non-size increasing computation POPL 2002