First Page | Document Content | |
---|---|---|
![]() Date: 2004-01-12 11:58:29Complexity classes Computational complexity theory Alan Turing Models of computation Reduction Turing reduction Oracle machine NP P versus NP problem Theoretical computer science Applied mathematics Computability theory | Source URL: www.csupomona.eduDownload Document from Source WebsiteFile Size: 111,13 KBShare Document on Facebook |