Complexity of fixed-size bit-vector logics (Q504997)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of fixed-size bit-vector logics
scientific article

    Statements

    Complexity of fixed-size bit-vector logics (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2017
    0 references
    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 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references