Hans Kleine Büning, Anja Remshagen: An upper bound for the circuit complexity of existentially quantified Boolean formulas. Theor. Comput. Sci. 411(31-33): 2864-2870 (2010)