Introduction to the Theory of Computation

Michael Sipser

book completed cs-theory

Year 2012

automata Turing machines P vs NP from:books

Notes

Automata, computability, complexity. The clearest treatment.

All Media More in Cs-Theory