Timeline for Meaning of epsilon in proving a PRG is predictable/ un predictable
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 28, 2019 at 19:35 | vote | accept | Mark | ||
| Apr 24, 2019 at 16:49 | answer | added | Squeamish Ossifrage | timeline score: 3 | |
| Apr 24, 2019 at 15:34 | answer | added | Paul Uszak | timeline score: -1 | |
| Apr 24, 2019 at 15:11 | history | edited | Mark | CC BY-SA 4.0 |
added transcript
|
| Apr 24, 2019 at 15:03 | comment | added | Mark | we say that G:K -> {0,1}^n is predictable if ∃ "eff" algorithm A and ∃ 1 < i < n-1 s.t k <- K pr[ A(G(K) |1,...., i = G(K) | i+1] > 1/2 + ε for some non negligible ε | |
| Apr 24, 2019 at 14:35 | review | First posts | |||
| Apr 24, 2019 at 14:59 | |||||
| Apr 24, 2019 at 14:34 | comment | added | Squeamish Ossifrage | Can you please transcribe whatever text or formulas are in the video? | |
| Apr 24, 2019 at 14:33 | history | asked | Mark | CC BY-SA 4.0 |