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.

The Multiplicative Complexity of Boolean Functions

Claus-Peter Schnorr. The Multiplicative Complexity of Boolean Functions. In Teo Mora, editor, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988, Proceedings. Volume 357 of Lecture Notes in Computer Science, pages 45-58, Springer, 1988.

Abstract

Abstract is missing.

runs on