On the Robustness of Functional Equations
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (6) , 1972-1997
- https://doi.org/10.1137/s0097539796298625
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Self-Testing without the Generator BottleneckSIAM Journal on Computing, 2000
- Free Bits, PCPs, and Nonapproximability---Towards Tight ResultsSIAM Journal on Computing, 1998
- Stability of Functional Equations in Several VariablesPublished by Springer Nature ,1998
- Efficient Checkers for Number-Theoretic ComputationsInformation and Computation, 1995
- Random-Self-Reducibility of Complete SetsSIAM Journal on Computing, 1993
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- The use of Taylor series to test accuracy of function programsACM Transactions on Mathematical Software, 1991
- Performance evaluation of programs related to the real gamma functionACM Transactions on Mathematical Software, 1991
- On hiding information from an oracleJournal of Computer and System Sciences, 1989
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984