Why P vs. NP is so hard?

by · May 25, 2017 · 452 views ·

We are missing methods for proving nontrivial lower bounds on the computational complexity of concrete problems, and thus, we are missing approaches enabling to solve fundamental problems of complexity theory such as P vs. NP, DLOG vs. NLOG etc. http://praguecomputerscience.cz/index.php?l=en&p=29

Watch SlidesLive on mobile devices

© SlidesLive Inc.