Introduction to Networks
NP Completeness and Logical Satisfiability
Read directions and background in
- Introduction to kSAT and colorability
- kSAT Exercise
- Lecture on NP-completeness, computational complexity, and phase transitions
All necessary files are linked at the left.
James P. Sethna, Christopher R. Myers, Erich J. Mueller.
Last modified: September 2014
Statistical Mechanics: Entropy, Order Parameters, and Complexity,
now available at
Oxford University Press
(USA,
Europe).