Find link

language:

Find link is a tool written by Edward Betts.

searching for Boolean matrix 21 found (29 total)

Context-free language (2,152 words) [view diff] exact match in snippet view article find links to article

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

Color-coding (1,988 words) [view diff] exact match in snippet view article find links to article

length k / 2 − 1 {\displaystyle k/2-1} in each of G1 and G2. Suppose the boolean matrix A1 and A2 represent the connectivity of each pair of vertices in G1

Transitive closure (2,306 words) [view diff] exact match in snippet view article find links to article

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

Context-free grammar (6,143 words) [view diff] exact match in snippet view article find links to article

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

School timetable (1,074 words) [view diff] exact match in snippet view article find links to article

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

Boris M. Schein (444 words) [view diff] case mismatch in snippet view article find links to article

Boris M. Schein at the Mathematics Genealogy Project Ki-Hang Kim (1982) Boolean Matrix Theory and Applications, page 37, Marcel Dekker ISBN 0-8247-1788-0 Professor

Dynamic substructuring (6,653 words) [view diff] exact match in snippet view article find links to article

_{2}^{B}} . This condition can be expressed using a so-called signed Boolean matrix, denoted by B {\displaystyle \mathbf {B} } . For the given example this

Nested dissection (504 words) [view diff] exact match in snippet view article find links to article

m is the number of non-zeros. Cycle rank of a graph, or a symmetric Boolean matrix, measures the minimum parallel time needed to perform Cholesky decomposition

Schedule (2,127 words) [view diff] exact match in snippet view article find links to article

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

Outer product (2,942 words) [view diff] case mismatch in snippet view article find links to article

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

Parsing expression grammar (6,505 words) [view diff] exact match in snippet view article find links to article

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

Transitive reduction (2,279 words) [view diff] exact match in snippet view article find links to article

transitive closure, Aho et al. rely on the already-known equivalence with Boolean matrix multiplication. They let A be the adjacency matrix of the given directed

State encoding for low power (1,499 words) [view diff] exact match in snippet view article find links to article

give low power dissipation when synthesized. This algorithm uses a boolean matrix with rows corresponding to state codes and columns corresponding to

Stencil buffer (2,391 words) [view diff] exact match in snippet view article find links to article

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

Plankalkül (2,743 words) [view diff] exact match in snippet view article find links to article

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

Formal concept analysis (5,372 words) [view diff] exact match in snippet view article find links to article

order dimension (of the concept lattice) and has applications e.g. for Boolean matrix factorization. Given an object-attribute numerical data-table, the goal

Online matrix-vector multiplication problem (989 words) [view diff] exact match in snippet view article find links to article

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}

Ki-Hang Kim (1,287 words) [view diff] exact match in snippet view article find links to article

Introduction to mathematical consensus theory (1980) with F W Roush. Boolean matrix theory and applications (1982) Applied abstract algebra (1983) with

Binary relation (8,830 words) [view diff] case mismatch in snippet view article find links to article

Informaticae 126(1): 37–82 doi:10.3233/FI-2013-871 Ki-Hang Kim (1982) Boolean Matrix Theory and Applications, page 37, Marcel Dekker ISBN 0-8247-1788-0 Ali

APL (programming language) (9,846 words) [view diff] exact match in snippet view article

≠' ';] The following function "life", written in Dyalog APL, takes a Boolean matrix and calculates the new generation according to Conway's Game of Life

Powersoft (3,213 words) [view diff] exact match in snippet view article find links to article

technologies. DSP, Dante, a very high channel count and a full non-Boolean matrix make the Ottocanali the amplifier of choice for multi-zone installations