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

DOI10.1007/978-3-642-38536-0_33zbMath1345.68172OpenAlexW177940266MaRDI QIDQ4928502

Armin Biere, Andreas Fröhlich, Gergely Kovásznai

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_33

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Satisfiability Modulo Theories ⋮ On the complexity of the quantified bit-vector arithmetic with binary encoding ⋮ Complexity of fixed-size bit-vector logics ⋮ Colors Make Theories Hard ⋮ Deciding Bit-Vector Formulas with mcSAT

Uses Software

• bv2epr

This page was built for publication: More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding