Self-testing polynomial functions efficiently and over rational domains

Authors:
Ronitt Rubinfeld;Madhu Sudan
Affiliations:
-;-
Venue:
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Year:
1992

Citing 7
Cited 18

Designing programs that check their work

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Hiding instances in multioracle queries

STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Self-testing/correcting with applications to numerical problems

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximating clique is almost NP-complete (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Designing programs that check their work

Journal of the ACM (JACM)
The Power of Interaction

The Power of Interaction

Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A taxonomy of proof systems (part 2)

ACM SIGACT News
Nearly-linear size holographic proofs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Testing multivariate linear functions: overcoming the generator bottleneck

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Software reliability via run-time result-checking

Journal of the ACM (JACM)
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Spot-checkers

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximate testing with relative error

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Low-degree tests

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey

Theoretical aspects of computer science
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey

Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Approximate testing with error relative to input size

Journal of Computer and System Sciences
Probabilistically Checkable Proofs Over the Reals

Electronic Notes in Theoretical Computer Science (ENTCS)
Testing juntas: a brief survey

Property testing
Testing juntas: a brief survey

Property testing
Almost transparent short proofs for NPR

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simple modification of the algorithm for self-testing polynomials over finite fields given in [8].