On the Shannon function for the generation of Boolean matrices
type: Item
instance of: scholarly article
title: On the Shannon function for the generation of Boolean matrices
zbMATH Open document ID: 0915.94011
author: A. V. Chashkin
published in: Moscow University Mathematics Bulletin
publication date: 1999-07-12T00:00:00Z
review text: 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.
reviewed by: Indulis Strazdins
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 1256304
zbMATH Keywords: Boolean matrix
zbMATH Keywords: complexity function
zbMATH Keywords: Shannon functions
zbMATH Keywords: asymptotically exact formulas
zbMATH Keywords: functional circuits
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1256304