default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity and Property Testing 2020
- Oded Goldreich
:
Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation. Lecture Notes in Computer Science 12050, Springer 2020, ISBN 978-3-030-43661-2 - Scott E. Decatur, Oded Goldreich, Dana Ron:
A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy. 1-8 - Oded Goldreich, Or Meir:
Bridging a Small Gap in the Gap Amplification of Assignment Testers. 9-16 - Oded Goldreich:
On (Valiant's) Polynomial-Size Monotone Formula for Majority. 17-23 - Oded Goldreich:
Two Comments on Targeted Canonical Derandomizers. 24-35 - Oded Goldreich:
On the Effect of the Proximity Parameter on Property Testers. 36-40 - Oded Goldreich, Avi Wigderson:
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. 41-86 - Oded Goldreich:
On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing. 87-118 - Oded Goldreich, Liav Teichner:
Super-Perfect Zero-Knowledge Proofs. 119-140 - Oded Goldreich, Dana Ron:
On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition). 141-151 - Oded Goldreich:
The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution. 152-172 - Roei Tell:
A Note on Tolerant Testing with One-Sided Error. 173-177 - Oded Goldreich, Maya Leshkowitz:
On Emulating Interactive Proofs with Public Coins. 178-198 - Oded Goldreich:
Reducing Testing Affine Spaces to Testing Linearity of Functions. 199-219 - Oded Goldreich:
Deconstructing 1-Local Expanders. 220-248 - Oded Goldreich, Guy N. Rothblum:
Worst-Case to Average-Case Reductions for Subclasses of P. 249-295 - Oded Goldreich:
On the Optimal Analysis of the Collision Probability Tester (an Exposition). 296-305 - Oded Goldreich, Avishay Tal:
On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions. 306-325 - Oded Goldreich, Guy N. Rothblum:
Constant-Round Interactive Proof Systems for AC0[2] and NC1. 326-351 - Oded Goldreich:
Flexible Models for Testing Graph Properties. 352-362 - Itai Benjamini, Oded Goldreich:
Pseudo-mixing Time of Random Walks. 363-373 - Oded Goldreich:
On Constructing Expanders for Any Number of Vertices. 374-379
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-29 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
