Check out my first novel, midnight's simulacra!
CS GRE: Difference between revisions
From dankwiki
No edit summary |
|||
| Line 16: | Line 16: | ||
**'''CLR''': Thomas Cormen, Charles Leiserson and Ron Rivest, ''[http://www.amazon.com/Introduction-Algorithms-Second-Thomas-Cormen/dp/0262032937 Introduction to Algorithms]''. First edition, 19th printing. | **'''CLR''': Thomas Cormen, Charles Leiserson and Ron Rivest, ''[http://www.amazon.com/Introduction-Algorithms-Second-Thomas-Cormen/dp/0262032937 Introduction to Algorithms]''. First edition, 19th printing. | ||
**'''SIPSER''': Michael Sipser, ''[http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/053494728X Introduction to the Theory of Computation]''. First edition, first printing. | **'''SIPSER''': Michael Sipser, ''[http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/053494728X Introduction to the Theory of Computation]''. First edition, first printing. | ||
**'''KNUTH2''': Donald Knuth, ''[http://www.amazon.com/gp/product/0201896842 The Art of Computer Programming, Vol. 2: Seminumerical Algorithms]''. Third edition, first printing. | **'''KNUTH2''': Donald Knuth, ''[http://www.amazon.com/gp/product/0201896842 The Art of Computer Programming, Vol. 2: Seminumerical Algorithms]''. Third edition, first printing. | ||
Further texts are listed in the applicable sections below. | Further texts are listed in the applicable sections below. | ||
| Line 165: | Line 164: | ||
|- | |- | ||
| Computational complexity, including NP-completeness | | Computational complexity, including NP-completeness | ||
* | * Garey and Johnson, ''[http://www.amazon.com/Computers-Intractability-NP-Completeness-Mathematical-Sciences/dp/0716710455 Computers and Intractability: A Guide to the Theory of NP-Completeness]'' | ||
| '''SIPSER''' 7, 8 | | '''SIPSER''' 7, 8 | ||
|- | |- | ||
| Line 171: | Line 170: | ||
|- | |- | ||
| Models of computation (finite automata, Turing machines) | | Models of computation (finite automata, Turing machines) | ||
* Hopcroft and Ullman, ''[http://www.amazon.com/Introduction-Automata-Theory-Languages-Computation/dp/0201441241 Introduction to Automata Theory, Languages and Computation]'' | |||
| '''SIPSER''' 1, 3 | | '''SIPSER''' 1, 3 | ||
|- | |- | ||
| Formal languages and grammars (regular and context free) | | Formal languages and grammars (regular and context free) | ||
* Gurari, ''[http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk.html An Introduction to the Theory of Computation]'' | |||
| '''SIPSER''' 2 | | '''SIPSER''' 2 | ||
|- | |- | ||
