Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms (Q800318)
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: Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms |
scientific article; zbMATH DE number 3875162
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms |
scientific article; zbMATH DE number 3875162 |
Statements
Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms (English)
0 references
1983
0 references
partial substitutions
0 references
expansion of Boolean functions
0 references
time decomposition
0 references
generalized graph schemes of algorithms
0 references
microprocessor realization
0 references
0.86624384
0 references
0.8646318
0 references
0.8559654
0 references
0.84719944
0 references
0.84702873
0 references
