[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums

OT: Practical consequences of P = NP

Posted By: Timothy Chow
Date: Saturday, 19 May 2012, at 9:31 p.m.

In Response To: The next major revolution in backgammon bots (Bob Koca)

If someone finds a very efficient algorithm for an NP-complete problem, that would in particular mean that cryptography as we know it would go out the window. Whether that would be good for society is a matter of opinion.

The computer scientist Russell Impagliazzo wrote a famous paper in which he described five different possible worlds (Algorithmica, Heuristica, Pessiland, Minicrypt, and Cryptomania), depending on which computational assumptions turn out to be true. See this blog post for a summary and a link to Impagliazzo's paper, where he describes other consequences of P = NP.

Messages In This Thread

 

Post Response

Your Name:
Your E-Mail Address:
Subject:
Message:

If necessary, enter your password below:

Password:

 

 

[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums is maintained by Stick with WebBBS 5.12.