1. [1] A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, “Symbolic modelchecking without BDDs,” in Tools and Algorithms for the Construction and Analysis of Systems, pp.193-207, 1999.
2. [2] R.B. Boppana and M. Sipser, “The complexity of finite functions,” in Handbook of theoretical computer science (vol.a), pp.757-804, MIT Press, Cambridge, MA, USA, 1990.
3. [3] C. Calabro, “The exponential complexity of satisfiability problems,” PhD thesis, University of California, San Diego, 2009.
4. [4] C. Calabro, R. Impagliazzo, and R. Paturi, “The complexity of satisfiability of small depth circuits,” Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, Sept. 2009, Revised Selected Papers, pp.75-85, Springer-Verlag, Berlin, Heidelberg, 2009.
5. [5] A.K. Chandra, L. Stockmeyer, and U. Vishkin, “Constant depth reducibility,” SIAM J. on Comput, vol.13, no.2, pp.423-439, 1984.