On monotone simulations on nonmonotone networks
type: Item
instance of: scholarly article
title: On monotone simulations on nonmonotone networks
zbMATH Open document ID: 0674.94024
DOI: 10.1016/0304-3975(89)90142-4
author: Paul E. Dunne
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 4104871
zbMATH Keywords: n-argument monotone Boolean function
zbMATH Keywords: superlinear lower bounds
zbMATH Keywords: combinatorial complexity
zbMATH Keywords: superpolynomial complexity
zbMATH Keywords: slice functions
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90142-4
OpenAlex ID: W1963559764
cites work: The monotone circuit complexity of Boolean functions
cites work: A Boolean function requiring 3n network size
cites work: The complexity of central slice functions
cites work: Q3758729
cites work: Lower bounds on monotone complexity of the logical permanent
cites work: An Algorithm for the Computation of Linear Forms
cites work: A complexity theory based on Boolean algebra
cites work: Negation is Powerless for Boolean Slice Functions
cites work: Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
cites work: On the complexity of slice functions
cites work: More on the complexity of slice functions
cites work: Q3221885
Wikidata QID: Q127152337
description: scientific article; zbMATH DE number 4104871