Compositional complexity of Boolean functions
type: Item
instance of: scholarly article
title: Compositional complexity of Boolean functions
zbMATH Open document ID: 0481.68048
DOI: 10.1016/0166-218X(82)90029-4
author: Harold Abelson
author: Andrzej Ehrenfeucht
author: Jan Mycielski
author: James Wildon Fickett
published in: Discrete Applied Mathematics
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 3755871
zbMATH Keywords: functional decomposition
MaRDI profile type: Publication
cites work: Towards a theory of local and global in computation
cites work: Practical decidability
cites work: Q5581642
cites work: On boolean functions and connected sets
cites work: Q4133967
cites work: Q5595902
cites work: Computational Work and Time on Finite Machines
cites work: The network complexity and the Turing machine complexity of finite functions
description: scientific article; zbMATH DE number 3755871