Switching Functions Whose Monotone Complexity Is Nearly Quadratic

@article{Wegener1978SwitchingFW,
  title={Switching Functions Whose Monotone Complexity Is Nearly Quadratic},
  author={Ingo Wegener},
  journal={Theor. Comput. Sci.},
  year={1978},
  volume={9},
  pages={83-97}
}
A sequence of monotone switching functions f<subscrpt>n</subscrpt>:{0,1}<supscrpt>n</supscrpt> &ran;{0,1}<supscrpt>n</supscrpt> is constructed, such that the monotone complexity of f<subscrpt>n</subscrpt> grows faster than O(n<supscrpt>2−ε</supscrpt>) for any ε>O. Previously the best lower bounds of this nature were several O(n<supscrpt>3/2</supscrpt… CONTINUE READING