Efficient checking of polynomials and proofs and the hardness of approximation problems
From MaRDI portal
Publication:1906841
DOI10.1007/3-540-60615-7zbMath0861.68042OpenAlexW4254084739WikidataQ56017262 ScholiaQ56017262MaRDI QIDQ1906841
Publication date: 24 January 1996
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60615-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Algebraic testing and weight distributions of codes. ⋮ A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! ⋮ Self-correcting polynomial programs ⋮ Unnamed Item ⋮ A novel elementary construction of matching vectors ⋮ On quasilinear-time complexity theory ⋮ Non-interactive proofs of proximity ⋮ Limits on the Rate of Locally Testable Affine-Invariant Codes ⋮ Public Key Locally Decodable Codes with Short Keys ⋮ Short Locally Testable Codes and Proofs ⋮ Constant-Round Interactive Proofs for Delegating Computation
This page was built for publication: Efficient checking of polynomials and proofs and the hardness of approximation problems
