Can I read On the complexity of narrow systems of Boolean vectors on EtoBox?

On the complexity of narrow systems of Boolean vectors by A. V. CHASHKIN is a scholarly article available to read on EtoBox.

What is On the complexity of narrow systems of Boolean vectors about?

We consider the complexity of generating systems of Boolean vectors by circuits. The unit vectors are used as the initial vectors called generators. We investigate the behaviour of the Shannon function of the complexity of systems in the case, where the number of vectors in the systems and the logarithm of their dimension are of the same order, and obtain an asymptotically exact formula for the Shannon function.

Author

A. V. CHASHKIN

Publisher

Walter de Gruyter GmbH

Published

1999

Language

EN