On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width (bibtex)
by G. Kovásznai, A. Fröhlich, A. Biere
Reference:
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-WidthG. Kovásznai, A. Fröhlich, A. BiereProc. 10th Intl. Work. on Satisfiability Modulo Theories (SMT'12), pages 12 pages, 2012.
Bibtex Entry:
@inproceedings{KovasznaiFroehlichBiere-SMT12,
title = {On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded
Bit-Width},
url = {/pubpdf/on_the-complexity-of-fixed-size-big-vector-logics.pdf},
booktitle = {Proc.~10th Intl.~Work.~on Satisfiability Modulo Theories (SMT'12)},
author = {G. Kov\'{a}sznai and A. Fr\"{o}hlich and A. Biere},
year = {2012},
pages = {12 pages},
}
Powered by bibtexbrowser