A method for obtaining efficient lower bounds for monotone complexity
type: Item
instance of: scholarly article
title: A method for obtaining efficient lower bounds for monotone complexity
zbMATH Open document ID: 0659.94020
DOI: 10.1007/BF01978380
published in: Algebra and Logic
publication date: 1987-01-01T00:00:00Z
review text: See the review in Zbl 0643.94027.
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4079329
zbMATH Keywords: complexity of monotone circuits
zbMATH Keywords: monotone Boolean functions
author: Alexander E. Andreev
MaRDI profile type: Publication
cites work: Q5616839
cites work: Complexity of monotone networks for Boolean matrix product
cites work: Q3924096
cites work: Monotone switching circuits and Boolean matrix product
cites work: Some remarks on Boolean sums
cites work: Switching functions whose monotone complexity is nearly quadratic
cites work: Q3701344
cites work: Q4726174
cites work: Q3758729
cites work: Lower bounds on monotone complexity of the logical permanent
cites work: Q4054934
cites work: Q4081112
description: scientific article; zbMATH DE number 4079329