On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width Gergely Kov´ asznai, Andreas Fr¨ohlich, Armin Biere Institute for Formal Models and Verification - On the bit - Document - PDFSEARCH.IO

First Page	Meta Content
	On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width Gergely Kov´ asznai, Andreas Fr¨ohlich, Armin Biere Institute for Formal Models and Verification Add to Reading List Document Date: 2012-06-20 03:34:17 Open Document File Size: 365,35 KB Share Result on Facebook

On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width Gergely Kov´ asznai, Andreas Fr¨ohlich, Armin Biere Institute for Formal Models and VerificationAdd to Reading List