First Page | Document Content | |
---|---|---|
![]() Date: 2010-01-14 13:30:09Complexity classes Mathematical optimization NP-complete problems Logical truth Boolean algebra P versus NP problem Boolean satisfiability problem NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics | Source URL: www.ams.orgDownload Document from Source WebsiteFile Size: 869,81 KBShare Document on Facebook |