Complex Boolean networks obtained by diagonalization

DOI10.1016/0304-3975(85)90036-2zbMath0567.94014OpenAlexW2060486404MaRDI QIDQ1060185

Bruno Scarpellini

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90036-2

zbMATH Keywords

complexity of Boolean functionspolytape machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• A Boolean function requiring 3n network size
• Lower bound results on lengths of second-order formulas
• The network complexity and the Turing machine complexity of finite functions
• The polynomial-time hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complex Boolean networks obtained by diagonalization