Login / Signup

Circuit Complexity and Multiplicative Complexity of Boolean Functions.

Arist KojevnikovAlexander S. Kulikov
Published in: CiE (2010)
Keyphrases
  • boolean functions
  • computational complexity
  • high speed
  • uniform distribution
  • polynomial size
  • worst case