Back to Results
First PageMeta Content
Computational complexity theory / Theoretical computer science / Theory of computation / Logic in computer science / Formal methods / Boolean algebra / Complexity classes / Electronic design automation / Satisfiability modulo theories / True quantified Boolean formula / FO / NC


Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,
Add to Reading List

Document Date: 2015-12-11 18:43:06


Open Document

File Size: 1,33 MB

Share Result on Facebook