"More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics ..."

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

> Home

Details and statistics

DOI: 10.1007/978-3-642-38536-0_33

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/csr/FrohlichKB13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/FrohlichKB13
Andreas Fröhlich, Gergely Kovásznai, Armin Biere:
More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding. CSR 2013: 378-390

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.