First Page | Document Content | |
---|---|---|
![]() Date: 2012-07-31 20:46:00Complexity classes Circuit complexity ACC0 NTIME Cook–Levin theorem PP Natural proof NP-complete Time complexity Theoretical computer science Computational complexity theory Applied mathematics | Source URL: www.stanford.eduDownload Document from Source WebsiteFile Size: 325,02 KBShare Document on Facebook |