First Page | Document Content | |
---|---|---|
![]() Date: 2002-04-24 17:27:28NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science 2-satisfiability Conjunctive normal form PP MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics | Source URL: research.microsoft.comDownload Document from Source WebsiteFile Size: 512,37 KBShare Document on Facebook |
![]() | Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted PublishedDocID: 1xTZi - View Document |
![]() | Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted PublishedDocID: 1xTH1 - View Document |
![]() | PP_icon-1_Einladung_A4_L3.inddDocID: 1xTEi - View Document |
![]() | ADVANCE INFORMATION 100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 ppDocID: 1xTyC - View Document |
![]() | Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted PublishedDocID: 1xTht - View Document |