A Theorem on Boolean Matrices

A Theorem on Boolean Matrices (1962)

by Tephen Warshall

Venue:	Journal of the ACM
Citations:	163 - 0 self

Datum	Value	Source
TITLE	A Theorem on Boolean Matrices	INFERENCE
AUTHOR NAME	Tephen Warshall	SVM HeaderParse 0.2
AUTHOR AFFIL	; Comptger A ssociales, Inc., Woburn	SVM HeaderParse 0.2
AUTHOR ADDR	; Massachusetts; 12 STEPHEN WARSIIALL	SVM HeaderParse 0.2
ABSTRACT	Given two boolean matrices A arid B, we define the boolean product A A B as that matrix whose (i, j)th entry is vk(a~/, A bki). We define tile boolean sum A V B as that matrix whose (i, j)th entry is a ij V b~j. The use of boolean matrices to represent program topology (Presser [1], and Marimont [2], t'or example) has led to interest in algorithms for transforming the d × d boolean matrix M to the d × d boolean matrix M ' given by: d M ' = v M s where we defineM ~ = MandM ~+I = M ~AM.	SVM HeaderParse 0.2
YEAR	1962	INFERENCE
VENUE	Journal of the ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	11--12	INFERENCE
VOLUME	9	INFERENCE
CITATIONS	2 found	ParsCit 1.0