scientific article; zbMATH DE number 7359363
From MaRDI portal
Publication:4993289
DOI10.4230/LIPIcs.ITCS.2018.26zbMath1462.68052MaRDI QIDQ4993289
Srikanth Srinivasan, Madhu Sudan
Publication date: 15 June 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Randomized algorithms (68W20) Decoding (94B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching is as easy as matrix inversion
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
- A probabilistic remark on algebraic program testing
- Self-testing/correcting with applications to numerical problems
- How to share a secret
- Testing low-degree polynomials over prime fields
- Proof verification and the hardness of approximation problems
- On the efficiency of local decoding procedures for error-correcting codes
- Testing Polynomials over General Fields
- Locally testable codes and PCPs of almost-linear length
- Testing Reed–Muller Codes
- Probabilistic checking of proofs
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Algebraic methods for interactive proof systems
- Robust Characterizations of Polynomials with Applications to Program Testing
- Optimal Testing of Reed-Muller Codes
- Decoding Reed-Muller codes over product sets
- Some 3CNF Properties Are Hard to Test
- The PCP theorem by gap amplification
This page was built for publication:
