More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding (bibtex)
by Andreas Fröhlich, Gergely Kovásznai, Armin Biere
Reference:
More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary EncodingAndreas Fröhlich, Gergely Kovásznai, Armin BiereProceedings of the 8th International Computer Science Symposium in Russia (CSR 2013), volume 7913 of Lecture Notes in Computer Science, pages 378-390, 25-29 June 2013, Springer.
Bibtex Entry:
@inproceedings{FrohlichKovasznaiBiereCSR2013,
  author    = {Andreas Fr\"ohlich and Gergely Kov\'asznai and Armin Biere},
  title     = {More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding},
  booktitle = {Proceedings of the 8th International Computer Science Symposium in Russia (CSR 2013)},
  address   = {Ekaterinburg, Russia},
  year      = {2013},
  month     = {25-29 June},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {7913},
  pages     = {378-390},
  URL       = {http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-38535-3}
}
Powered by bibtexbrowser