Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes (Q677360)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes |
scientific article; zbMATH DE number 996812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes |
scientific article; zbMATH DE number 996812 |
Statements
Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes (English)
0 references
21 April 1997
0 references
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.
0 references
Boolean formula
0 references
linear binary graph
0 references
0.7975911498069763
0 references
0.7893251180648804
0 references
0.7725764513015747
0 references
