Table of ContentsP vs. NP and Quantum Computation Overview Computability Theory Complexity Theory P Rates of Growth Problems in P Graph 2-colorability Exponential time NP Example: Is N composite? More NP examples Another characterization P = NP ? NP-completeness Quantum Computation Quantum Cats What's a qubit? Quantum Computers: Theory Complexity (we think) The Future of Cryptography |
Author: Sandy Kutin
Email: kutin@uchicago.edu Home Page: http://people.cs.uchicago.edu/~kutin/CSPP532 |