On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width (bibtex)
by Gergely Kovásznai, Andreas Fröhlich, Armin Biere
Reference:
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-WidthGergely Kovásznai, Andreas Fröhlich, Armin BiereProceedings of the 10th International Workshop on Satisfiability Modulo Theories (SMT 2012), aff. to IJCAR 2012, pages 44-55, 30 June 30 - 1 July 2012.
Bibtex Entry:
@inproceedings{KovasznaiFrohlichBiereSMT2012,
  author    = {Gergely Kov\'asznai and Andreas Fr\"ohlich and Armin Biere},
  title     = {On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width},
  booktitle = {Proceedings of the 10th International Workshop on Satisfiability Modulo Theories (SMT 2012), aff. to IJCAR 2012},
  address   = {Manchester, UK},
  year      = {2012},
  month     = {30 June 30 - 1 July},
  pages     = {44-55},
  URL       = {http://smt2012.loria.fr/SMT2012.pdf}
}
Powered by bibtexbrowser