Nearly optimal hierarchies for network and formula size

DOI10.1007/BF00289499zbMath0569.94020MaRDI QIDQ1061717

B. George

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

gapsnetwork sizeformula sizecomplexity hierarchies for Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
• Unnamed Item

This page was built for publication: Nearly optimal hierarchies for network and formula size