Stephen Warshall
- 1 PROSSER, REESE T. Applications of Boolean matrices to the analysis of flow diagrams. Proc. Eastern Joint Comput. Conf. No. 16 (1959), 133.Google Scholar
- 2 MARIMONT, ROSALIND B. A new method of checking the consistency of precedence matrices. J. ACM 6, (1959) 164. Google Scholar
Index Terms
- A Theorem on Boolean Matrices
Recommendations
The g-theorem matrices are totally nonnegative
The g-theorem proved by Billera, Lee, and Stanley states that a sequence is the g-vector of a simplicial polytope if and only if it is an M-sequence. For any d-dimensional simplicial polytope the face vector is gM"d where M"d is a certain matrix whose ...
Representing (0, 1)-matrices by boolean circuits
A boolean circuit represents an n by n(0,1)-matrix A if it correctly computes the linear transformation y->=Ax-> over GF(2) on all n unit vectors. If we only allow linear boolean functions as gates, then some matrices cannot be represented using fewer ...
Lehman matrices
A pair of square 0,1 matrices A,B such that AB^T=E+kI (where E is the nxn matrix of all 1s and k is a positive integer) are called Lehman matrices. These matrices figure prominently in Lehman's seminal theorem on minimally nonideal matrices. There are ...
Comments