Date: 2010-01-26 05:02 pm (UTC)
From: [identity profile] ciphergoth.livejournal.com
Communications of the ACM edition 09/2009 is all about the state of the P vs NP problem, which might be relevant. Of course even if we could solve P vs NP, that still only applies to worst-case problems, and we need average-case for cryptography.

The Wikipedia entry on "Results about difficulty of proof" is also interesting.

(will be screened)
(will be screened if not validated)
If you don't have an account you can create one now.
HTML doesn't work in the subject.
More info about formatting

If you are unable to use this captcha for any reason, please contact us by email at support@dreamwidth.org

 
Notice: This account is set to log the IP addresses of people who comment anonymously.
Links will be displayed as unclickable URLs to help prevent spam.

Profile

ciphergoth: (Default)
Paul Crowley
My Website

January 2025

S M T W T F S
   1234
5678 91011
12131415161718
19202122232425
262728293031 

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Aug. 11th, 2025 04:05 am
Powered by Dreamwidth Studios