On the Shannon function for the generation of Boolean matrices (Q1279418)
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 1256304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Shannon function for the generation of Boolean matrices |
scientific article; zbMATH DE number 1256304 |
Statements
On the Shannon function for the generation of Boolean matrices (English)
0 references
12 July 1999
0 references
The author establishes asymptotically exact formulas for the complexity (Shannon) functions of generating Boolean \(p\times q\) matrices and symmetric Boolean matrices of order \(q\) that express the number of elements in functional circuits \(S(r,p,q)\) and terms in the corresponding formulas \(F(r,p,q)\) using at most \(r\)-place disjunction and conjunctions. The relation to similar graph complexity problems is mentioned.
0 references
Boolean matrix
0 references
complexity function
0 references
Shannon functions
0 references
asymptotically exact formulas
0 references
functional circuits
0 references
0.8462481498718262
0 references
0.8177041411399841
0 references
0.8129304647445679
0 references
