Steven Rudich
Top View
- Expander-Based Cryptography Meets Natural Proofs
- Novel Frameworks for Mining Heterogeneous and Dynamic
- Natural Proofs
- The Sample Complexity of Parity Learning in the Robust Shuffle Model
- Chicago Journal of Theoretical Computer Science MIT Press
- Towards an Algebraic Natural Proofs Barrier Via Polynomial Identity Testing
- On Statistically Secure Obfuscation with Approximate Correctness
- The P Versus NP Problem
- FOCS '94 the 35Thannual IEEE Conference on Foundations Of
- Sublinear-Time Adaptive Data Analysis
- Structure Vs Combinatorics in Computational Complexity∗
- DIMACS Research and Education Institute (DREI '97) Cryptography
- John Von Neumann
- Salil P. Vadhan
- Comparing Information Without Leaking It
- Structure Vs Combinatorics in Computational Complexity∗
- The Computational Complexity Column by Vikraman Arvind Institute of Mathematical Sciences, CIT Campus, Taramani Chennai 600113, India