Timeline for Length of the certificate in complexity classes
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 10, 2012 at 23:09 | answer | added | Ben | timeline score: 5 | |
| Oct 10, 2012 at 20:04 | history | edited | Raphael |
edited tags
|
|
| Oct 10, 2012 at 19:02 | answer | added | Vor | timeline score: 2 | |
| Sep 11, 2012 at 21:44 | review | Suggested edits | |||
| Sep 11, 2012 at 22:01 | |||||
| Sep 11, 2012 at 0:02 | history | tweeted | twitter.com/#!/StackCompSci/status/245311356432175105 | ||
| Sep 10, 2012 at 15:49 | answer | added | mrk | timeline score: 0 | |
| Sep 10, 2012 at 14:35 | history | migrated | from cstheory.stackexchange.com (revisions) | ||
| Sep 10, 2012 at 9:16 | comment | added | Ingrid Morstrad | Could you elaborate about the latter? | |
| Sep 10, 2012 at 8:57 | comment | added | Ricky Demer | No, it means that the length of the certificate is $O(f(n))$. Yes. Umm..., by running the certificate verification algorithm on its hint. | |
| Sep 10, 2012 at 8:11 | history | asked | Ingrid Morstrad | CC BY-SA 3.0 |