1. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching (May 1996)
2. Calabro, C.: A lower bound on the size of series-parallel graphs dense in long paths. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 15(110) (2008)
3. Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of unique k-sat: An isolation lemma for k-cnfs. J. Comput. Syst. Sci. 74(3), 386–393 (2008)
4. Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for sat. In: CCC 2006: Proceedings of the 21st Annual IEEE Conference on Computational Complexity, Washington, DC, USA, 2006, pp. 252–260. IEEE Computer Society Press, Los Alamitos (2006)
5. Lecture Notes in Computer Science;E. Dantsin,2005