Timeline for Accurate definition of BPP
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2013 at 7:58 | history | tweeted | twitter.com/#!/StackCompSci/status/335665584295534592 | ||
| Apr 9, 2013 at 11:59 | comment | added | adrianN | Concrete understanding of difference between PP and BPP definitions is a related question. | |
| Apr 8, 2013 at 14:39 | history | edited | Raphael |
edited tags
|
|
| Apr 8, 2013 at 1:08 | answer | added | Yuval Filmus | timeline score: 6 | |
| Apr 7, 2013 at 23:37 | history | migrated | from cstheory.stackexchange.com (revisions) | ||
| Apr 7, 2013 at 14:08 | comment | added | MCH | Each time you run the algorithm, you must use fresh random bits. | |
| Apr 7, 2013 at 5:19 | comment | added | Sasho Nikolov | frankly your second paragraph doesn't make any sense to me. what you are missing is that for amplification you run $M(x)$ many times and and take the majority vote of all the runs - this changes the probability of success. with your analogy: pick a ball a 1000 times, what is the probability that more than half the balls are blue? | |
| Apr 7, 2013 at 3:51 | history | asked | MachPortMassenger | CC BY-SA 3.0 |