scientific article; zbMATH DE number 742944

MaRDI QIDQ4763385zbMATH OpenFDO

Authors Ronitt Rubinfeld, Madhu Sudan

Publication date 11 April 1995

zbMATH Keywords

checkersself-testersself-testing polynomials

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A self-tester for linear functions over the integers with an elementary proof of correctness
• Robust Characterizations of Polynomials with Applications to Program Testing
• scientific article; zbMATH DE number 1263217
• Zero testing of algebraic functions
• Self-Testing without the Generator Bottleneck

Cited in

(14)

• Approximate testing with error relative to input size.
• Almost transparent short proofs for \(\mathrm{NP}_{\mathbb R}\)
• Worst-Case to Average-Case Reductions for Subclasses of P
• Testers and their applications
• Self-testing/correcting with applications to numerical problems
• A self-tester for linear functions over the integers with an elementary proof of correctness
• Fast Reed-Solomon interactive oracle proofs of proximity
• Testing juntas: a brief survey
• Hardness of coloring 2-colorable 12-uniform hypergraphs with \(2^{(\log n)^{\Omega(1)}}\) colors
• Probabilistically checkable proofs and their consequences for approximation algorithms
• Reusable online-efficient commitments
• Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
• Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
• Self-correcting polynomial programs

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 Q4763385)