Time of computations on linear binary graphs

MaRDI QIDQ1922443zbMATH OpenFDO

Authors B. P. Kuznetsov

Publication date 16 March 1997

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

zbMATH Keywords

binary programBoolean formulacomputation timelinear binary graph

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes
• Graph-Based Algorithms for Boolean Function Manipulation
• Average time of computing Boolean operators
• scientific article; zbMATH DE number 3957104
• scientific article; zbMATH DE number 1037955

Cited in

(4)

• Tunable binary procedures and programs with loops
• Computing Resolution-Path Dependencies in Linear Time ,
• On the graph traversal method for evaluating linear binary-chain programs
• Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes

This page was built for publication: Time of computations on linear binary graphs

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