PRIME BOOLEAN MATRICESDE CAEN D; GREGORY DA.1980; LECTURE NOTES MATH.; ISSN 0075-8434; DEU; DA. 1980; NO 829; PP. 76-82; BIBL. 3 REF.Conference Paper

UNA DECOMPOSIZIONE IN GRAFI PARZIALI DELL' 1-GRAFO ORIENTATO, COMPLETO, SIMMETRICO DI ORDINE N = UNE DECOMPOSITION EN GRAPHES PARTIELS D'UN 1-GRAPHE ORIENTE, COMPLET, SYMETRIQUE D'ORDRE NFADINI A.1972; RIC., MAT. PURE APPL.; ITAL.; DA. 1972; VOL. 23; PP. 11-14; ABS. ANGLSerial Issue

A FAST EXPECTED TIME ALGORITHM FOR BOOLEAN MATRIX MULTIPLICATION AND TRANSITIVE CLOSUREO'NEIL PE; O'NEIL EJ.1973; INFORM. AND CONTROL; U.S.A.; DA. 1973; VOL. 22; NO 2; PP. 132-138; BIBL. 4 REF.Serial Issue

EDGE TRACING IN BINARY ARRAYSSARAGA P; WAVISH PR.1972; INST. PHYS. CONF. SER., LONDON; G.B.; DA. 1972; NO 13; PP. 294-302; BIBL. 8 REF.Serial Issue

A NEW RESULT ON THE PROBLEM OF ZARANKIEWICZMOERS M.1981; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1981; VOL. 31; NO 2; PP. 126-130; BIBL. 6 REF.Article

SUR LES THEOREMES D'INVARIANCE POUR LES MATRICES BOOLEENNES STOCHASTIQUESKOVALENKO IN.1975; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1975; NO 5; PP. 138-152; ABS. ANGL.; BIBL. 4 REF.Article

FUZZY CHAINS. = CHAINES FLOUESKANDEL A; YELOWITZ L.1974; I.E.E.E. TRANS. SYST. MAN CYBERN.; U.S.A.; DA. 1974; VOL. 4; NO 5; PP. 472-475; BIBL. 28 REF.Article

ANALYSE DES MATRICES BOOLEENNES LIEES A LA SOLUTION DE QUELQUES PROBLEMES GENETIQUESMIRKIN BG; RODIN SN.1974; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 2; PP. 108-114; ABS. ANGL.; BIBL. 13 REF.Article

A LOWER BOUND FOR THE PERMANENT ON U_N(K.K)HARTFIEL DJ; CROSBY JW.1972; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1972; VOL. 12; NO 2; PP. 283-288; BIBL. 6 REF.Serial Issue

MATRIX REDUCTION. AN EFFICIENT METHOD.JOHNSTON HC; HOARE CAR.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 3; PP. 141-150; BIBL. 7 REF.Article

A MOORE-PENROSE INVERSE FOR BOOLEAN RELATION MATRICES.KIM KI HANG BUTLER.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 403; PP. 18-28; BIBL. 15 REF.; (COMB. MATH. PROC. 2ND AUST. CONF.; MELBOURNE; 1973)Conference Paper

DETERMINATION OF A GENERALIZED INVERSE OF A BOOLEAN RELATION MATRIX.NIEMINEN J.1973; CONTROL AND CYBERN.; POLAND; DA. 1973; VOL. 2; NO 1-2; PP. 127-132; ABS. POL. RUSSE; BIBL. 7 REF.Article

ON GENERALIZED REED-MULLER EXPANSIONSSWAMY S.1972; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1972; VOL. 21; NO 9; PP. 1008-1009; BIBL. 3 REF.Serial Issue

ON HOMOMORPHIC IMAGES OF TRANSITION GRAPHS.NIEMINEN J.1975; INFORM. PORCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 1; PP. 14-15; BIBL. 8 REF.Article

ON GENERALIZED INVERSES OF BOOLEAN MATRICES. IIBHASKARA RAO KPS; PRASADA RAO PSSNV.1982; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1982; VOL. 42; NO 1; PP. 133-144; BIBL. 2 REF.Article

PROGRAMME DE TRANSPOSITION DES MATRICES (TRANS)LOSEVA VL; KOSAREV YU G.1974; VYCHISLIT. SIST.; S.S.S.R.; DA. 1974; NO 59; PP. 90-100Article

ASUPRA IMPLEMENTARII ALGORITMULUI DE ANALIZA SINTACTICA AL LUI DOEMOELKI = SUR L'IMPLEMENTATION DE L'ANALYSEUR SYNTAXIQUE DE DOEMOELKIKASA Z.1981; STUD. UNIV. BABES-BOLYAI, MATH.; ROM; DA. 1981; VOL. 26; NO 1; PP. 15-23; ABS. ENG; BIBL. 2 REF.Article

MATHEMATICAL SOLUTION FOR A DATA PROCESSING SYSTEMLOIZOU G.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 5; PP. 252-256; BIBL. 5 REF.Article

COMPUTING THE MAXIMUM GENERALIZED INVERSE OF A BOOLEAN MATRIX.FITZ GERALD DG.1977; LINEAR ALGEBRA APPL.; U.S.A.; DA. 1977; VOL. 16; NO 3; PP. 203-207; BIBL. 5 REF.Article

A MODIFICATION OF WARSHALL'S ALGORITHM FOR THE TRANSITIVE CLOSURE OF BINARY RELATIONS.WARREN HS JR.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 4; PP. 218-220; BIBL. 5 REF.Article

CHAINES DE LONGUEUR MAXIMUM D'UN ARBREKERGALL Y.sdINFORMAT. SCI. HUM.; FRA; DA. S.D.; VOL. 10; NO 43; PP. 31-43; BIBL. 11 REF.Article

SYNTHESE DES RESEAUX LOGIQUES POUR LA REALISATION DES CLASSES DE MATRICES BOOLEENNES AVEC UN NOMBRE DONNE DE CELLULES ANGULAIRESGAVERLIK I.1982; BANACH CENT. PUBL.; ISSN 0137-6934; POL; DA. 1982; VOL. 7; PP. 177-195; BIBL. 8 REF.Article

PRIMES IN THE SEMIGROUP OF BOOLEAN MATRICESDE CAEN D; GREGORY DA.1981; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1981; VOL. 37; PP. 119-134; BIBL. 12 REF.Article

TWO FAMILIAR TRANSITIVE CLOSURE ALGORITHMS WHICH ADMIT NO POLYNOMIAL TIME, SUBLINEAR SPACE IMPLEMENTATIONSTOMPA M.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 333-338; BIBL. 17 REF.Conference Paper

LONGUEUR TYPIQUE DU RECOUVREMENT MINIMAL POUR LES TABLEAUX AVEC SPECTREUSTYUZHANINOV VG.1980; KIBERNETIKA; UKR; DA. 1980; NO 5; PP. 24-27; ABS. ENG; BIBL. 5 REF.Article