Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes

MaRDI QIDQ677360zbMATH OpenFDO

Authors B. P. Kuznetsov, A. A. Shalyto

Publication date 21 April 1997

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

Boolean formulalinear binary graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Review text

Estimates are obtained for the number and the total length of routes in binary linear graphs realizing Boolean formulae. The estimates characterize the logical complexity of the corresponding binary programs. Part I has been published in Eng. Cybern. 1994, No.5.

Recommendations

• Time of computations on linear binary graphs
• On the realisation of Boolean functions by informational graphs
• scientific article; zbMATH DE number 4218008
• The number of Boolean functions computed by formulas of a given size
• scientific article; zbMATH DE number 1294417

Cited in

(2)

• Tunable binary procedures and programs with loops
• Time of computations on linear binary graphs

This page was built for publication: Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes

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