Cook’s Paper Online and Reformatted

December 15, 2009

Tim Rohlfs has transcribed Stephan Cook’s seminal paper, The Complexity of Theorem-Proving Procedures, on complexity into a clean form.

Read it! I think it’d be nice to get it into HTML with annotations.

%d bloggers like this: