Courses from 1000+ universities
Coursera sees headcount decrease and faces lawsuit in 2023, invests in proprietary content while relying on Big 5 partners.
600 Free Google Certifications
Artificial Intelligence
Business Intelligence
Data Analysis
Justice
Multilingual Practices: Tackling Challenges and Creating Opportunities
Introductory Human Physiology
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore NP-hardness of approximating meta-complexity using cryptographic constructions with Hanlin Ren from the University of Oxford, offered by Simons Institute.
Explore the characterization of one-way functions through worst-case hardness assumptions with Shuichi Hirahara from the Simons Institute. Less than 1-hour workload.
Explore derandomization techniques with MIT's Lijie Chen in this 1-2 hour tutorial from Simons Institute. Learn to transform interactive protocols into NP-type verifiers under strong hardness assumptions.
Explore SNARGs for monotone policy batch NP languages under the LWE assumption with Yael Tauman Kalai from Microsoft Research at Simons Institute. Less than 1-hour workload.
Explore cryptographic hardness of correlated sampling with Russell Impagliazzo from UC San Diego, offered by Simons Institute. Less than 1-hour workload.
Explore the concept of incompressibility and next-block pseudoentropy in cryptography with Iftach Haitner from Tel Aviv University, in this less than 1-hour material by Simons Institute.
Learn Cryptography and Kolmogorov Complexity in a quick tutorial by Simons Institute. Ideal for those with 1-2 hours to spare.
Explore constant-round arguments using one-way functions in this under 1-hour material from Simons Institute. Learn about cryptography with minimal complexity assumptions.
Explore cryptography and complexity theory in under an hour with Simons Institute's panel discussion on minimal complexity assumptions.
Explore the interplay between Indistinguishability Obfuscation and the Minimum Circuit Size Problem in this short program by Simons Institute. Gain insights into cryptography and computational security.
Explore obfuscation's role in theoretical computer science, including bounded arithmetic, metacomplexity, and differential privacy, in this less than 1-hour talk by Rahul Ilango at Simons Institute.
Learn cryptography with minimal complexity assumptions in a 1-2 hour tutorial by Rachel Lin from the Simons Institute.
Explore fine-grained cryptography with Simons Institute, focusing on achieving strong guarantees against restricted adversarial classes. Less than 1-hour workload.
Explore the complexities of two-party differential privacy with UC Berkeley's Naom Mazor in this under 1-hour material from Simons Institute. Delve into cryptography and data privacy.
Explore communication complexity and streaming with Simons Institute. Learn how computational limitations can improve algorithms and bypass impossibility results. Duration: 1-2 hours.
Get personalized course recommendations, track subjects and courses with reminders, and more.