Compositional complexity of Boolean functions

DOI10.1016/0166-218X(82)90029-4zbMath0481.68048MaRDI QIDQ1162360

Andrzej Ehrenfeucht, Harold Abelson, Jan Mycielski, James Wildon Fickett

Publication date: 1982

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

functional decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Decomposability of partially defined Boolean functions

Cites Work

• Practical decidability
• The network complexity and the Turing machine complexity of finite functions
• Towards a theory of local and global in computation
• On boolean functions and connected sets
• Computational Work and Time on Finite Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item