Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Tim Pruss, Priyank Kalla, Florian Enescu. Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases. In The 51st Annual Design Automation Conference 2014, DAC '14, San Francisco, CA, USA, June 1-5, 2014. pages 1-6, ACM, 2014. [doi]

This author has not been identified. Look up 'Tim Pruss' in GoogleThis author has not been identified. Look up 'Priyank Kalla' in GoogleThis author has not been identified. Look up 'Florian Enescu' in Google

runs on WebDSL