On complexity of schemes in incomplete bases (Q1280360)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1261647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of schemes in incomplete bases |
scientific article; zbMATH DE number 1261647 |
Statements
On complexity of schemes in incomplete bases (English)
0 references
15 March 1999
0 references
The paper deals with the problem of complexity of the realization of Boolean functions from closed classes by schemes of functional elements in incomplete bases. For the Shannon functions corresponding to some closed classes upper bounds are obtained.
0 references
Shannon function
0 references
upper bound
0 references
complexity
0 references
Boolean functions
0 references
schemes of functional elements
0 references
0.9332892894744872
0 references
0.8642389178276062
0 references
