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

MaRDI QIDQ1101067zbMATH OpenFDO

Authors L. Ya. Lapkin

Publication date 1987

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

zbMATH Keywords

binary programsBoolean functionscomplexity boundsmatrix programs

Mathematics Subject Classification ID

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

Review text

We examine the complexity bounds on binary, k-ary, and matrix programs which represent Boolean functions specified in various forms.

Cited in

(4)

• On the complexity of the evaluation of transient extensions of Boolean functions
• scientific article; zbMATH DE number 6004901 (Why is no real title available?)
• scientific article; zbMATH DE number 5077425 (Why is no real title available?)
• scientific article; zbMATH DE number 1746571 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101067)