More on the complexity of quantifier-free fixed-size bit-vector logics with binary encoding (Q4928502)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6176269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More on the complexity of quantifier-free fixed-size bit-vector logics with binary encoding |
scientific article; zbMATH DE number 6176269 |
Statements
More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding (English)
0 references
14 June 2013
0 references
0.9488474130630492
0 references
0.8468814492225647
0 references
0.7917983531951904
0 references
0.7524756789207458
0 references
0.7523676156997681
0 references
