On the complexity of 2-output Boolean networks
type: Item
instance of: scholarly article
title: On the complexity of 2-output Boolean networks
zbMATH Open document ID: 0473.94021
DOI: 10.1016/0304-3975(81)90074-8
author: S. H. Smith
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3743178
zbMATH Keywords: combinational complexity
zbMATH Keywords: Boolean functions
zbMATH Keywords: monotone network
zbMATH Keywords: combinational networks
MaRDI profile type: Publication
full work available at URL: 0304-3975(81)90074-8
OpenAlex ID: W1976287608
cites work: Practical decidability
cites work: The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
cites work: Complexity of monotone networks for Boolean matrix product
cites work: Q4119126
cites work: Realizing Boolean functions on disjoint sets of variables
cites work: The complexity of monotone boolean functions
cites work: Relations Among Complexity Measures
cites work: The Power of Negative Thinking in Multiplying Boolean Matrices
cites work: Q5536039
cites work: Q4138141
cites work: The network complexity and the Turing machine complexity of finite functions
cites work: On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
description: scientific article; zbMATH DE number 3743178