/explore
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
rjlipton.com
|
|
| | | | | Our favorite problem moribund? The photo at right was taken by a friend-with thanks-in San Carlos, California, last weekend. We do not know who put out the Halloween display. My late colleague Alan Selman sported a license plate that declared P NE NP (NE for "not equal to"). Dick and I last gave our thoughts... | |
| | | | |
rjlipton.com
|
|
| | | | | Further discussions of the proof that factoring is in BQP Scott Aaronson is a, if not the, world expert on quantum computation. He writes, as you all know, one of the best blogs on quantum and many more things. Today I and Ken want to make a short summary on the last discussion: is factoring... | |
| | | | |
pressron.wordpress.com
|
|
| | | | | Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better... | |
| | | | |
www.livescience.com
|
|
| | | When quantum computers become commonplace, current cryptographic systems will become obsolete. Scientists are racing to get ahead of the problem and keep our data secure. | ||
