@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} }

- Published 1978 in STOC
DOI:10.1145/800133.804342

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

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=804342.

### Presentations referencing similar topics