Date: 2014-08-26 19:53:27Computational complexity theory Theoretical computer science Logic in computer science Boolean algebra Circuit complexity Complexity classes Electronic design automation True quantified Boolean formula Satisfiability modulo theories NC FO Boolean circuit | | Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,Add to Reading ListSource URL: csl.sri.comDownload Document from Source Website File Size: 372,61 KBShare Document on Facebook
|