No. | Title | Author | Year |
---|---|---|---|
1 | Every Set in P Is Strongly Testable Under a Suitable Encoding | Dinur, Irit et al. | 2018 |
2 | Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets | Goldreich, Oded et al. | 2018 |
3 | The Subgraph Testing Model | Goldreich, Oded et al. | 2018 |
4 | On Randomness Extraction in AC0 | Goldreich, Oded et al. | 2015 |
5 | Strong Locally Testable Codes with Relaxed Local Decoders | Goldreich, Oded et al. | 2015 |
6 | On Multiple Input Problems in Property Testing | Goldreich, Oded | 2014 |
7 | Approximating Average Parameters of Graphs | Goldreich, Oded et al. | 2006 |
8 | Contemplations on Testing Graph Properties | Goldreich, Oded | 2006 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 8 |