1. Algorithms and Combinatorics;S Jukna,2012
2. Find, M.G., Golovnev, A., Hirsch, E.A., Kulikov, A.S.: A better-than-3n lower bound for the circuit complexity of an explicit function. In: Dinur, I. (ed.) IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, Hyatt Regency, New Brunswick, NJ, USA, 9–11 October 2016, pp. 89–98. IEEE Computer Society (2016)
3. Golovnev, A., Hirsch, E.A., Knop, A., Kulikov, A.S.: On the limits of gate elimination. [27], pp. 46:1–46:13
4. Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner, Hoboken (1987)
5. Lamagna, E.A., Savage, J.E.: On the logical complexity of symmetric switching functions in monotone and complete bases. Technical report, Brown University (1973)