Skip to main content

Timeline for PRG existance and P versus NP

Current License: CC BY-SA 3.0

4 events
when toggle format what by license comment
May 6, 2014 at 17:10 comment added user991 Well, this is the sledge-hammer proof. $\:$ One could just use a SAT algorithm to break the security of any candidate PRG. $\;\;\;\;$
May 6, 2014 at 14:43 history edited mikeazo CC BY-SA 3.0
deleted 55 characters in body
May 6, 2014 at 14:31 history edited mikeazo CC BY-SA 3.0
added 4 characters in body
May 6, 2014 at 13:11 history answered mikeazo CC BY-SA 3.0