Reviewing bounds on the circuit size of the hardest functions

  • Authors:

  • Gudmund Skovbjerg Frandsen;Peter Bro Miltersen

  • Affiliations:

  • BRICS11Basic Research in Computer Science, Centre of the Danish National Research Foundation., Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, DK-8200 Aarhus N, Denma ...;BRICS11Basic Research in Computer Science, Centre of the Danish National Research Foundation., Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, DK-8200 Aarhus N, Denma ...

  • Venue:
  • Information Processing Letters
  • Year:
  • 2005

Quantified Score

Hi-index 0.89

Visualization

Abstract

In this paper we review the known bounds for L(n), the circuit size complexity of the hardest Boolean function on n input bits. The best known bounds appear to be 2^nn(1+lognn-O(1n))=