First Page | Document Content | |
---|---|---|
![]() Date: 2007-08-26 10:17:21Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Satisfiability Modulo Theories Solver True quantified Boolean formula Theoretical computer science Applied mathematics Mathematics | Source URL: pst.istc.cnr.itDownload Document from Source WebsiteFile Size: 306,19 KBShare Document on Facebook |