More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding (bibtex)
by A. Fröhlich, G. Kovásznai, A. Biere
Reference:
More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary EncodingA. Fröhlich, G. Kovásznai, A. BiereProc. 8th Intl. Computer Science Symp. in Russia (CSR'13), pages 12 pages, 2013, Springer.
Bibtex Entry:
@inproceedings{FroehlichKovasznaiBiere-CSR13,
publisher = {Springer},
title = {More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics
with Binary Encoding},
url = {/pubpdf/More_on_the_Complexity_of_Quantifier-Free_Fixed-Size_Bit-Vector_Logics_with_Binary_Encoding.pdf},
series = {LNCS},
booktitle = {Proc.~8th Intl.~Computer Science Symp.~in Russia (CSR'13)},
author = {A. Fr\"{o}hlich and G. Kov\'{a}sznai and A. Biere},
year = {2013},
pages = {12 pages},
}
Powered by bibtexbrowser