- integers, fixed-width
bitvectors, floating-point
arithmetic (often
implemented in SMT
solvers via bit-blasting, i.e.,
reduction to
bitvectors), strings, (co)-datatypes...
- l e c t q {\displaystyle \mathbf {select} _{q}}
operations defined on
bitvectors to
arbitrary alphabets.
Originally introduced to
represent compressed...
-
vertices may be
labeled by
bitvectors, in such a way that two
vertices are
adjacent if and only if the
corresponding bitvectors differ in a
single position...
- A bit
array (also
known as bitmask, bit map, bit set, bit string, or bit vector) is an
array data
structure that
compactly stores bits. It can be used...
- Java analysis.
Every bitvector problem is also an IFDS problem, but
there are
several significant IFDS
problems that are not
bitvector problems, including...
-
theories of
linear arithmetic over
rationals and integers, fixed-width
bitvectors, floating-point arithmetic, strings, (co)-datatypes,
sequences (used to...
-
parameter n, that can
recognize pairs of
words (encoded in a
certain way by
bitvectors) that are
within Levenshtein distance n of each other.
Touzet proposed...
-
graphs are
partial cubes,
graphs in
which the
nodes can be
labeled by
bitvectors in such a way that the
graph distance equals the
Hamming distance between...
-
bottom 4 bits of AL to form a 12-bit
bitvector, then left-rotates this
bitvector by 4 bits, then
writes this
bitvector back to its
argument and the bottom...
-
communications protocol would be for one of the
three parties to
transmit a
bitvector describing the
intersection of the two sets
known to that party, after...
