'Deterministic polynomial' presentation slideshows

The Theory of NP-Completeness

608 views • 60 slides

The Theory of NP-Completeness

The Theory of NP-Completeness. NP. =. NPC. P. P. X. P=NP. ?. NP: Non-deterministic Polynomial. P: Polynomial. NPC: Non-deterministic Polynomial Complete. P : the class of problems which can be solved by a deterministic p olynomial algorithm.

754 views • 59 slides

Roadmap of the lecture

Roadmap of the lecture. Computational complexity polynomial vs. exponential algorithms non-deterministic computing N(ondetermiistic) P(olynomial) problems Example: the Traveling Salesman Problem (TSP) Some non-TM (?) models of computing Social insects

234 views • 16 slides