Can I read Understanding NP-Complete Languages on EtoBox?

Understanding NP-Complete Languages by RockyRam is a document available to read on EtoBox.

What is Understanding NP-Complete Languages about?

This document discusses NP-complete languages and polynomial time reductions. It begins by defining polynomial time computable functions and polynomial time reductions. It then states that if language A is polynomial time reducible to language B, and B is in P, then A is also in P. An example is given of reducing 3CNF satisfiability to the CLIQUE problem by transforming a 3CNF formula into a graph. The document concludes that the satisfiability problem (SAT) is NP-complete, by showing that any language in N

Author

RockyRam

Language

EN