More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding

Andreas Fröhlich, Gergely Kovásznai, Armin Biere. More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding. In Andrei A. Bulatov, Arseny M. Shur, editors, Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings. Volume 7913 of Lecture Notes in Computer Science, pages 378-390, Springer, 2013. [doi]

Abstract

Abstract is missing.