P vs NP
We’ve reached the NP-completeness section of my Fundamental Algorithms class, and I’ve noticed something interesting about P and NP. class P NP-complete Euler tour Hamiltonian Cycle 2-SAT 3-SAT Shortest path Longest simple path We have problems from a variety of…