First Page | Document Content | |
---|---|---|
![]() Date: 2008-11-10 13:57:34Mathematical optimization NP-complete problems Combinatorial optimization Complexity classes Maximum cut Semidefinite programming NP 2-satisfiability Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics | Source URL: www.cs.cornell.eduDownload Document from Source WebsiteFile Size: 423,31 KBShare Document on Facebook |