External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the Complexity of Balanced Boolean Functions

Anna Bernasconi. On the Complexity of Balanced Boolean Functions. In Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista, editors, Algorithms and Complexity, Third Italian Conference, CIAC 97, Rome, Italy, March 12-14, 1997, Proceedings. Volume 1203 of Lecture Notes in Computer Science, pages 253-263, Springer, 1997.

Abstract

Abstract is missing.

runs on