Complexity of fixed-size bit-vector logics (Q504997)
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: Complexity of fixed-size bit-vector logics |
scientific article; zbMATH DE number 6676008
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of fixed-size bit-vector logics |
scientific article; zbMATH DE number 6676008 |
Statements
Complexity of fixed-size bit-vector logics (English)
0 references
18 January 2017
0 references
SMT
0 references
satisfiability modulo theories
0 references
bit-vectors
0 references
bit-vector logics
0 references
binary encoding
0 references
logarithmic encoding
0 references
unary encoding
0 references
complexity
0 references
NEXPTIME
0 references
PSPACE
0 references
NP
0 references
SAT
0 references
0 references
0 references
0 references
0.9273419
0 references
0.9078941
0 references
0.8919195
0 references
0.88899076
0 references
0.8878852
0 references
0.8824486
0 references
0.8823006
0 references
0.87616676
0 references
0.87616676
0 references
