HW2 Q2c
Eden F. (guest) 07 Apr 2019 00:14
Do we need to prove the statement for the trivial protocol of testing random strings, or do we need to prove that it holds for any (optimal) protocol?
HW2 Q2c
Quick Info
- Instructor:
- Nir Bitansky
- Lectures:
- Dach, Wednesday 15:00 - 18:00
- Teaching assistant:
- Eliad Tsfadia
- Recitations:
- Holtzblat, Sunday 11:00 - 12:00, 12:00 - 13:00
Mini Calendar
- Assignment 5 due: June 12
- Exam: June 28
- Moed B: September 26
Latest News
Example Exam - revised version and solutions
Edited Q1a and Q2c
(23 Jun 2019 07:19)
Example Exam
Solutions will be posted by Monday next week.
(20 Jun 2019 19:09)
Exam header
So that you don't need to waste time on instructions during the exam.
(11 Jun 2019 18:45)
Latest Posts
2.b. In an expected number of 10 rounds the attacker will be the leader. At this point, it can...
(by nbitansky 28 Jun 2019 00:37, posts: 2)
(by nbitansky 28 Jun 2019 00:37, posts: 2)
- $3$-message protocols (without any repetition) has soundness $1/2$. Doesn't have FS. (This is...
(by nbitansky 27 Jun 2019 13:34, posts: 5)
(by nbitansky 27 Jun 2019 13:34, posts: 5)
Hi, can you please give us an answer sketch for HW 5 Q2 section b, and for Q3 section a?
I asked...
(by daniel (guest) 27 Jun 2019 11:23, posts: 2)
(by daniel (guest) 27 Jun 2019 11:23, posts: 2)
Unless otherwise stated, the content of this page is licensed under
Creative Commons Attribution-ShareAlike 3.0 License
