First Page | Document Content | |
---|---|---|
![]() Date: 2012-05-29 03:59:19Constraint programming Logic in computer science Automated theorem proving Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Uninterpreted function Decision problem Theoretical computer science Mathematics Applied mathematics | Source URL: research.microsoft.comDownload Document from Source WebsiteFile Size: 267,13 KBShare Document on Facebook |