Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Gergely Kovásznai, Andreas Fröhlich, Armin Biere. Complexity of Fixed-Size Bit-Vector Logics. Theory Comput. Syst., 59(2):323-376, 2016. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-WidthGergely Kovásznai, Andreas Fröhlich, Armin Biere. cade 2013: 44-56 [doi] More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary EncodingAndreas Fröhlich, Gergely Kovásznai, Armin Biere. csr 2013: 378-390 [doi]
The following publications are possibly variants of this publication: