First Page | Document Content | |
---|---|---|
![]() Date: 2008-02-01 12:23:22Complexity classes Decision problem P versus NP problem NP-complete NP Polynomial Boolean satisfiability problem Time complexity 2-satisfiability Theoretical computer science Computational complexity theory Applied mathematics | Source URL: stationq.cnsi.ucsb.eduDownload Document from Source WebsiteFile Size: 207,16 KBShare Document on Facebook |