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

zbMATH Open0948.68089MaRDI QIDQ677360FDOQ677360

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)

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

zbMATH Keywords

Boolean formulalinear binary graph

Mathematics Subject Classification ID

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

Cited In (2)

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

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)