Testing Low-Degree Polynomials over GF(2)
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 188-199
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Some 3CNF properties are hard to test2003
- Regular languages are testable with a constant number of queries2003
- Improved low-degree testing and its applications1997
- Interactive proofs and the hardness of approximating cliquesJournal of the ACM, 1996
- Improved non-approximability results1994
- Self-testing/correcting with applications to numerical problemsJournal of Computer and System Sciences, 1993
- Efficient probabilistically checkable proofs and applications to approximations1993
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Self-testing/correcting for polynomials and for approximate functions1991
- Checking computations in polylogarithmic time1991