Polyhedral Approximation of Multivariate Polynomials Using Handelman's Theorem
Abstract elided by the publisher.
Related papers
- Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions CAV 2026
- Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs OOPSLA 2023
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra POPL 2013
- Porting the HOL light analysis library: some lessons (invited talk) CPP 2017
- Formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials CPP 2016
- Counting polynomial roots in isabelle/hol: a formal proof of the budan-fourier theorem CPP 2019
- Non-polynomial Worst-Case Analysis of Recursive Programs TOPLAS 2019
- Non-polynomial Worst-Case Analysis of Recursive Programs CAV 2017