Complexity bounds on program realizations of Boolean functions specified in various forms

zbMath0641.94031MaRDI QIDQ1101067

L. Ya. Lapkin

Publication date: 1987

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

Boolean functionscomplexity boundsbinary programsmatrix programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

This page was built for publication: Complexity bounds on program realizations of Boolean functions specified in various forms