P, NP, and NP-Completeness

The Basics of Computational Complexity

Nonfiction, Science & Nature, Mathematics, Discrete Mathematics, Computers, General Computing, Programming

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Big bigCover of P, NP, and NP-Completeness

More books from Cambridge University Press

bigCover of the book Anti-Impunity and the Human Rights Agenda by

bigCover of the book Ranking the World by

bigCover of the book Studies in Expansive Learning by

bigCover of the book Love's Enlightenment by

bigCover of the book The Logic of Connective Action by

bigCover of the book Training the Party by

bigCover of the book Groups, Languages and Automata by

bigCover of the book The Cambridge Companion to Berlioz by

bigCover of the book Expressions of Time in Ancient Greek by

bigCover of the book Britain's Pacification of Palestine by

bigCover of the book Binomials in the History of English by

bigCover of the book Model Theory and the Philosophy of Mathematical Practice by

bigCover of the book Comparing Tort and Crime by

bigCover of the book Linguistic Interaction in Roman Comedy by

We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy