"On the Complexity of Balanced Boolean Functions."

Anna Bernasconi (1999)

Details and statistics

DOI: 10.1016/S0020-0190(99)00061-7

access: closed

type: Journal Article

metadata version: 2017-09-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics