"On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded ..."

Gergely Kovásznai, Andreas Fröhlich, Armin Biere (2012)

> Home

Details and statistics

DOI: 10.29007/CVNZ

access: open

type: Conference or Workshop Paper

metadata version: 2021-08-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/cade/KovasznaiFB12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cade/KovasznaiFB12
Gergely Kovásznai, Andreas Fröhlich, Armin Biere:
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width. SMT@IJCAR 2012: 44-56

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.