Skip to content

Opening book details…

About this Computer Science article

On the complexity of Boolean functions with small number of ones by Redkin, N. P. is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Redkin, N. P.
Publisher
Walter de Gruyter GmbH & Co. KG; Walter de Gruyter GmbH (ISSN 0924-9265)
Published
2004
Language
EN
Field
Computer Science (Physical Sciences)

More by Redkin, N. P.

Browse all works by Redkin, N. P.