mathematics, a Boolean matrix is a matrix with entries from a Boolean algebra. When the two-element Boolean algebra is used, the Boolean matrix is called a...

matrix, binary matrix, relation matrix, Boolean matrix, or (0, 1)-matrix is a matrix with entries from the Boolean domain B = {0, 1}. Such a matrix can...

Analysis of Boolean functions Balanced Boolean function Bent function Boolean algebras canonically defined Boolean function Boolean matrix Boolean-valued function...

exists if and only if (x,y) ∈ R. Boolean matrix: The members of X are arranged in some fixed sequence x1, ..., xn; the matrix has dimensions n × n, with the...

Boolean matrix multiplication, thus inheriting its complexity upper bound of O(n2.3728596). Conversely, Lillian Lee has shown O(n3−ε) Boolean matrix multiplication...

matrices used in mathematics, science and engineering. A matrix (plural matrices, or less commonly matrixes) is a rectangular array of numbers called entries...

parsing according to a general CFG is asymptotically equivalent to boolean matrix multiplication (thus likely between quadratic and cubic time). One classical...

reachable from node a. The data structure is typically stored as a Boolean matrix, so if matrix[1][4] = true, then it is the case that node 1 can reach node...

51, Cambridge University Press ISBN 0-521-59916-4 Ki-Hang Kim (1982) Boolean Matrix Theory and Applications, page 37, Marcel Dekker ISBN 0-8247-1788-0 Carlen...

may be applied include: computing the transitive closure of a graph, Boolean matrix multiplication, edit distance calculation, sequence alignment, index...

regarded as byte) is denoted by 8 × S 0 {\displaystyle 8\times S0} , and Boolean matrix of size m {\displaystyle m} by n {\displaystyle n}   is described by...

Boolean matrix multiplication, thus inheriting its complexity upper bound of O(n2.3728639). Conversely, Lillian Lee has shown O(n3−ε) Boolean matrix multiplication...

In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties...

condition can be expressed using a Boolean matrix. Use is made of the transpose of the Boolean localisation matrix L {\displaystyle \mathbf {L} } that...

the boolean domain {T,F}. The matrix, denoted with operators, can be expressed as The elements of the matrix can be named as shown below: Both matrix forms...

A Boolean network consists of a discrete set of Boolean variables each of which has a Boolean function (possibly different for each variable) assigned...

{\displaystyle X=Y} ) form a matrix semiring (indeed, a matrix semialgebra over the Boolean semiring) where the identity matrix corresponds to the identity...

Lee, Lillian (2002). "Fast context-free grammar parsing requires fast Boolean matrix multiplication". J. ACM. 49 (1): 1–15. arXiv:cs/0112018. doi:10.1145/505241...

ISSN 1572-9338. S2CID 254227100. Gunther Schmidt and Thomas Ströhlein (1976) "A Boolean matrix iteration in timetable construction", Linear Algebra and Its Applications...

Laplacian matrix for the latter. In the matrix notation, the adjacency matrix of the undirected graph could, e.g., be defined as a Boolean sum of the...

list stored in matrix X according to word length: X[⍋X+.≠' ';] The following function "life", written in Dyalog APL, takes a Boolean matrix and calculates...

In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set (usually {true, false}, {0,1} or {−1...

whether or not two vertices are connected (i.e., the connection matrix, which contains Boolean values), it gives the exact distance between them. The convention...

called the matrix semiring. Similarly, if R is a commutative semiring, then Mn(R) is a matrix semialgebra. For example, if R is the Boolean semiring (the...

Procedures for MPOs)". Gunther Schmidt and Thomas Ströhlein (1976) "A Boolean matrix iteration in timetable construction", Linear Algebra and Its Applications...

q&\Leftrightarrow &r=p+q{\pmod {2}}\\\end{matrix}}} The description of a Boolean function as a polynomial in F 2 {\displaystyle \mathbb {F} _{2}} , using...

to represent numerical values in the range [0, 2n-1], and also as a Boolean matrix (n is the number of allocated bits), each of which may be used to control...

integer n {\displaystyle n} and an n × n {\displaystyle n\times n} Boolean matrix M {\displaystyle M} . The algorithm then runs for n {\displaystyle n}...

boolean matrix A1 and A2 represent the connectivity of each pair of vertices in G1 and G2 by a colorful path, respectively, and let B be the matrix describing...

equivalence with Boolean matrix multiplication. They let A be the adjacency matrix of the given directed acyclic graph, and B be the adjacency matrix of its transitive...