1. Cracks in the defenses: Scouting out approaches on circuit lower bounds;Allender,2008
2. Isoperimetric problems in discrete spaces;Bezrukov,1994
3. A Boolean function requiring 3n network size;Blum;Theoret. Comput. Sci.,1984
4. Circuit minimization problem;Kabanets;Proc. Symp. Theory Comput.,2000
5. Explicit lower bound of 4.5n−o(n) for Boolean circuits;Lachish;Proc. 33rd ACM Symp. Theory Comput. (STOC 2001),2001