4 ms·
Is volume 4, fasicle 6 available for download, or do we need to buy the book itself? I'm very interested in SAT solvers, as this has deep connections to statis
by mathgenius 9y ago
Is volume 4, fasicle 6 available for download, or do we need to buy the book itself?
I'm very interested in SAT solvers, as this has deep connections to statistical mechanics and condensed matter physics.
- curuinor 9y agoknuth only touches on the condensed matter (survey, beliefprop) in like one section in the whole book, i recall. beautiful presentation, nothing about, say, the d1RSB and s1RSB transition or anything like that. try montanari's book
- mathgenius 9y agoYes I have montanari's book.
- svat 9y agoIt is independently available as a paperback, but also the "pre-fascicle" (draft version) is available for download: http://www-cs-faculty.stanford.edu/~knuth/fasc6a.ps.gz http://www-cs-faculty.stanford.edu/~knuth/fasc6a.ps.gz or click on 6A at http://www.cs.utsa.edu/~wagner/knuth/ http://www.cs.utsa.edu/~wagner/knuth/ specifically: http://www.cs.utsa.edu/~wagner/knuth/fasc6a2015.09.23.pdf http://www.cs.utsa.edu/~wagner/knuth/fasc6a2015.09.23.pdf His programs (SAT solvers) are also available on his site at https://cs.stanford.edu/~knuth/programs.html https://cs.stanford.edu/~knuth/programs.html (They are in CWEB and you'll have to use cweave and ctangle to read and run those programs respectively; if you just want to read I've typeset them here: https://github.com/shreevatsa/knuth-literate-programs/tree/1b86fdc/programs https://github.com/shreevatsa/knuth-literate-programs/tree/1...) Knuth has also given a couple of talks about satisfiability around the time he wrote the book: - https://www.pathlms.com/siam/courses/3028/sections/4140/video_presentations/31340 https://www.pathlms.com/siam/courses/3028/sections/4140/vide... (July 2016, at SIAM Annual Meeting) - https://www.youtube.com/watch?v=g4lhrVPDUG0 https://www.youtube.com/watch?v=g4lhrVPDUG0 (December 2016, at Brown University) Look at https://cs.stanford.edu/~knuth/news16.html#lectures https://cs.stanford.edu/~knuth/news16.html#lectures for slides and handouts from these talks.
- lifepillar 9y agoI attended one of his talks (but not the ones you mention), during which he described how he was approaching the topic. He said he was reading the most important papers on sat problems in chronological order, and implementing each of the algorithms he found along the way. At the time of the talk, he was half-way through the ‘80s, IIRC. A lesson in commitment and perseverance for me. And a very funny talk as well (Knuth likes jokes!)