scientific article; zbMATH DE number 2086425
From MaRDI portal
Publication:4736880
Recommendations
- Self-testing/correcting with applications to numerical problems
- Robust Characterizations of Polynomials with Applications to Program Testing
- Checking approximate computations of polynomials and functional equations
- Zero testing of algebraic functions
- A self-tester for linear functions over the integers with an elementary proof of correctness
Cited in
(10)- Noisy Chinese remaindering in the Lee norm
- Zero testing of algebraic functions
- On self-testing without the generator bottleneck
- Testers and their applications
- Correcting noisy exponentiation black-boxes modulo a prime
- On the Robustness of Functional Equations
- Algorithm 714: CELEFUNT: a portable test package for complex elementary functions
- Self-correcting for function fields of finite transcendental degree
- Software testing in computable analysis
- Sum-check protocol for approximate computations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736880)