3SAT問題を多項式時間で解くアルゴリズムが発表される。
P=NP証明に？
hylomによる 2011年01月24日 22時32分の掲載
Vladimir Romanov氏が、3SAT問題を解く多項式時間アルゴリズムなるものをリリースしたそうだ（該当のブログエントリ)3SAT問題はNP完全なので、この主張が正しければ、P=NPであることになる。ソースコードはGitHubにて公開されている 。
2011年1月25日火曜日
2011年1月22日土曜日
Selected Papers on Fun and Games
Selected Papers on Fun and Games (Center for the Study of Language and Information - Lecture Notes)
Knuth先生の論文集の８番目の本．さっそく買いに行かなくては？と思うのだけれど．
この本の紹介記事
This is the eighth in a series of eight volumes that contain archival forms of my published papers, together with new material. (The first book in the series was Literate Programming; the second was Selected Papers on Computer Science; the third was Digital Typography; the fourth was Selected Papers on Analysis of Algorithms; the fifth was Selected Papers on Computer Languages; the sixth was Selected Papers on Discrete Mathematics; the seventh was Selected Papers on Design of Algorithms.) The Fun and Games volume is characterized by the following remarks quoted from its preface.
パズルの本？
Knuth先生の論文集の８番目の本．さっそく買いに行かなくては？と思うのだけれど．
この本の紹介記事
This is the eighth in a series of eight volumes that contain archival forms of my published papers, together with new material. (The first book in the series was Literate Programming; the second was Selected Papers on Computer Science; the third was Digital Typography; the fourth was Selected Papers on Analysis of Algorithms; the fifth was Selected Papers on Computer Languages; the sixth was Selected Papers on Discrete Mathematics; the seventh was Selected Papers on Design of Algorithms.) The Fun and Games volume is characterized by the following remarks quoted from its preface.
パズルの本？
2011年1月7日金曜日
登録:
投稿 (Atom)
