Mehlhorn, K.; Galil, Z. Monotone switching circuits and Boolean matrix product. (English) Zbl 0323.94019 Computing 16, 99-111 (1976). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 18 Documents MSC: 94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010) 65F30 Other matrix algorithms (MSC2010) 15A12 Conditioning of matrices PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{Z. Galil}, Computing 16, 99--111 (1976; Zbl 0323.94019) Full Text: DOI References: [1] Lamagna, Savage: Combinational Complexity of Some Monotone Functions. 15th SWAT Conference, New Orleans, 1974, 140–144. [2] Mehlhorn: On the Complexity of Monotone Realizations of Matrix Multiplication. Universität des Saarlandes, TR 74-11 (1974). [3] Paterson: Complexity of Monotone Networks for Boolean Matrix Product. University of Warwick, TR 2, 1974. (To appear in Theoretical Computer Science.) [4] Pratt: The Power of Negative Thinking in Multiplying Boolean Matrices. 6th ACM Conference on Theory of Computing, Seattle, 1974, 80–83. · Zbl 0356.94049 [5] Schnorr: Lower Bounds on the Complexity of Monotone Networks (unpublished memo). This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.