scientific article; zbMATH DE number 742944
From MaRDI portal
Publication:4763385
zbMath0834.68076MaRDI QIDQ4763385
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Probabilistically checkable proofs and their consequences for approximation algorithms ⋮ A self-tester for linear functions over the integers with an elementary proof of correctness ⋮ Worst-Case to Average-Case Reductions for Subclasses of P ⋮ Approximate testing with error relative to input size. ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors ⋮ Quantum spectrum testing ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ Testing Juntas: A Brief Survey ⋮ Reusable online-efficient commitments ⋮ Almost Transparent Short Proofs for NPℝ ⋮ Self-testing/correcting with applications to numerical problems
This page was built for publication: