Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
type: Item
instance of: scholarly article
title: Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
zbMATH Open document ID: 0488.94035
DOI: 10.1016/0304-3975(89)90084-4
author: Ingo Wegener
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3769526
zbMATH Keywords: sequence of monotone Boolean functions
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90084-4
OpenAlex ID: W4230950430
cites work: The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
cites work: Some remarks on Boolean sums
cites work: Monotone switching circuits and Boolean matrix product
cites work: Q5656695
cites work: Complexity of monotone networks for Boolean matrix product
cites work: Shifting Graphs and Their Applications
cites work: The Power of Negative Thinking in Multiplying Boolean Matrices
cites work: Complexity of Monotone Networks for Computing Conjunctions
cites work: An Improved Lower Bound for Sorting Networks
cites work: Switching functions whose monotone complexity is nearly quadratic
cites work: A new lower bound on the monotone network complexity of Boolean sums
description: scientific article; zbMATH DE number 3769526