Switching functions whose monotone complexity is nearly quadratic
type: Item
instance of: scholarly article
title: Switching functions whose monotone complexity is nearly quadratic
zbMATH Open document ID: 0421.94023
DOI: 10.1016/0304-3975(79)90008-2
author: Ingo Wegener
published in: Theoretical Computer Science
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3655860
zbMATH Keywords: complexity of Boolean functions
zbMATH Keywords: products of Boolean matrices
zbMATH Keywords: monotonous switching circuits
MaRDI profile type: Publication
full work available at URL: 0304-3975(79)90008-2
OpenAlex ID: W2041228989
cites work: Monotone switching circuits and Boolean matrix product
cites work: Complexity of monotone networks for Boolean matrix product
cites work: The Power of Negative Thinking in Multiplying Boolean Matrices
cites work: Q4138141
cites work: Gaussian elimination is not optimal
description: scientific article; zbMATH DE number 3655860