First Page | Document Content | |
---|---|---|
![]() Date: 2007-01-08 22:00:38Complexity classes True quantified Boolean formula PSPACE-complete FO NP P NSPACE DSPACE Cook–Levin theorem Theoretical computer science Computational complexity theory Applied mathematics | Source URL: www.cs.princeton.eduDownload Document from Source WebsiteFile Size: 374,16 KBShare Document on Facebook |