Polynomial Time Code For 3-SAT Released, P==NP - Slashdot
Posted by CmdrTaco on Thursday January 20, 2011 @12:35PM from the heard-this-before dept. An anonymous reader writes "Vladimir Romanov has released what he claims is a polynomial-time algorithm for solving 3-SAT. Because 3-SAT is NP-complete, this would imply that P==NP. While there's still good reason to be skeptical that this is, in fact, true, he's made source code available and appears decided
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
"MythBusters" Drops Kari Byron, Grant Imahara, Tory Belleci - Slashdot
IBM Scientists Measure the Heat Emitted From Erasing a Single Bit - Slashdot
Scientists Study How Little Exercise You Need - Slashdot
Statue of Galileo Planned for Vatican - Slashdot
