Checking properties of polynomials
From MaRDI portal
Publication:4571953
DOI10.1007/3-540-63165-8_178zbMath1401.68191OpenAlexW2189136770MaRDI QIDQ4571953
S. Ravi Kumar, Funda Ergün, Peter S. Gemmell, Bruno Codenotti
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_178
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Self-testing/correcting with applications to numerical problems
- Principles for Testing Polynomial Zerofinding Programs
- Robust Characterizations of Polynomials with Applications to Program Testing
- Checking approximate computations over the reals
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item