Relating monotone formula size and monotone depth of Boolean functions
type: Item
instance of: scholarly article
title: Relating monotone formula size and monotone depth of Boolean functions
zbMATH Open document ID: 0504.94035
DOI: 10.1016/0020-0190(83)90011-X
author: Ingo Wegener
published in: Information Processing Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3795865
zbMATH Keywords: computational complexity
zbMATH Keywords: formula size
zbMATH Keywords: depth
zbMATH Keywords: monotone basis
zbMATH Keywords: trade-off- results
MaRDI profile type: Publication
cites work: Q4138141
cites work: Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
description: scientific article; zbMATH DE number 3795865