On the complexity of the quantified bit-vector arithmetic with binary encoding (Q1708270)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of the quantified bit-vector arithmetic with binary encoding |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the quantified bit-vector arithmetic with binary encoding |
scientific article |
Statements
On the complexity of the quantified bit-vector arithmetic with binary encoding (English)
0 references
5 April 2018
0 references
computational complexity
0 references
satisfiability modulo theories
0 references
fixed-size bit-vectors
0 references
0.8468814492225647
0 references
0.8181796669960022
0 references
0.7967643737792969
0 references
0.7514058351516724
0 references
0.743820309638977
0 references
