First Page | Document Content | |
---|---|---|
![]() Date: 2003-12-08 11:12:51Computational complexity theory Theory of computation Mathematics Complexity classes Computational problems Theoretical computer science Structural complexity theory Tutte polynomial NP Quantum computing Time complexity Reduction | Add to Reading List |
![]() | Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†DocID: 1xUdf - View Document |
![]() | Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-coDocID: 1xTKi - View Document |
![]() | PDF DocumentDocID: 1xSVG - View Document |
![]() | PDF DocumentDocID: 1xSM6 - View Document |
![]() | PDF DocumentDocID: 1xSJs - View Document |