Complexity Theory Lecture 6 Lecturer: Moni Naor. Recap Last week: Probabilistic Complexity 1.Schwatz-Zippel 2.Approximating Counting Problems Plus Alternation.
Complexity Theory Lecture 10 Lecturer: Moni Naor.
Complexity Theory Lecture 8 Lecturer: Moni Naor. Recap Last week: –Randomized Reductions –Low memory verifiers –#P Completeness of Permanent This Week:
How to Carpool Fairly Moni Naor. The carpool problem A group of n people form a carpool. – Each day a subset arrives to a (fixed) gathering point and.
Complexity Theory Lecture 7 Lecturer: Moni Naor. Recap Last week: Non-Uniform Complexity Classes Polynomial Time Hierarchy –BPP in hierarchy –If NP µ.
Complexity Theory Lecture 9 Lecturer: Moni Naor. Recap Last week: –Toda’s Theorem: PH P #P. –Program checking and hardness on the average of the permanent.
Foundations of Cryptography Lecture 10 Lecturer: Moni Naor.
Complexity Theory Lecture 1 Lecturer: Moni Naor. Computational Complexity Theory Study the resources needed to solve computational problems –Computer.
Foundations of Cryptography Lecture 13 Lecturer: Moni Naor.
Topics in Cryptography Lecture 7 Topic: Side Channels Lecturer: Moni Naor.
Foundations of Privacy Lecture 8 Lecturer: Moni Naor.
Foundations of Privacy Lecture 6 Lecturer: Moni Naor.
