DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Shmuel Safra
Shmuel Safra
Signature Redacted
UC Berkeley UC Berkeley Electronic Theses and Dissertations
Arxiv:2105.01193V1
Decidability of Secure Non-Interactive Simulation of Doubly Symmetric Binary Source
Lecture 25: Sketch of the PCP Theorem 1 Overview 2
Download This PDF File
List of Publications
Automata: from Logics to Algorithms
Interactive Proofs and the Hardness of Approximating Cliques
Hardness of Approximation, NP ⊆ PCP[Polylog,Polylog]
Open Main.Pdf
Composition of Low-Error 2-Query Pcps Using Decodable Pcps∗
Quadratic Span Programs and Succinct Nizks Without Pcps
Invariance Principle on the Slice. (English Summary) ACM Trans
On the Power of Many One-Bit Provers
Tight Static Lower Bounds for Non-Adaptive Data Structures
Threshold Phenomena and Influence with Some Perspectives From
Probabilistic Checking of Proofs: a New Characterization of NP
Top View
Very Efficient Approximation Algorithms to Edit Distance Problems
The Projection Games Conjecture and the NP-Hardness of Ln N
Algorithmic Construction of Sets for K-Restrictions
Novel Frameworks for Mining Heterogeneous and Dynamic
Moshe Y. Vardi
Hardness of Maximum Constraint Satisfaction by Siu on Chan A
Probabilistically Checkable Proofs and Hardness of Approximation
UG-Hardness to NP-Hardness by Losing Half
On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner 107
Lec. 7: Low Degree Testing (Part I) Lecturer: Prahladh Harsha Scribe: Nutan Limaye
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
Mathematisches Forschungsinstitut Oberwolfach
Threshold Phenomena and Influence
Quantum Information and the PCP Theorem
Two-Player Entangled Games Are NP-Hard
STOC ’95 to Qualify for the Early Registration Fee, Your Registration Application Must Be Postmarked by Monday, May 1, 1995
Satisfying Degree-D Equations Over GF[2]N
Decidability of Secure Non-Interactive Simulation of Doubly Symmetric Binary Source
Bibliography
Seminar in Honor of Professor Shafi Goldwasser November 22, 2017
The Complexity of Zero Knowledge
Algorithmic Construction of Sets for K-Restrictions
Lec. 4: the PCP Theorem and Inapproximability of Clique Lecturer: Prahladh Harsha Scribe: Girish Varma
Invariance Principle on the Slice