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

Andreas Fröhlich Gergely Kovásznai Armin Biere

Published in: CSR (2013)

Keyphrases

fixed size
bit vector
variable size
sliding window
quantifier free
first order logic
quantifier elimination
expressive power
computational complexity
database systems
rewrite systems
inference rules
theorem proving
orders of magnitude
relational databases
data streams
data sets
small image patches