1. Lecture Notes in Computer Science;V Arvind,2003
2. Bergroth, L., Hakonen, H., Raita, T.: A Survey of Longest Common Subsequence Algorithms. In: Proceedings of the 7th International Symposium on String Processing and Information Retrieval (SPIRE), pp. 39–48 (2000)
3. Bollig, B., Sauerhoff, M., Sieling, D., Wegener, I.: On the Power of Different Types of Restricted Branching Programs. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 1(26) (1994)
4. Bryant, R.E.: Graph-based Algorithm for Boolean Function Manipulation. IEEE Transaction on Computers 35(8), 677–691 (1986)
5. Calabro, C., Impagliazzo, R., Paturi, R.: A Duality between Clause Width and Clause Density for SAT. In: Proceedings of the 21st Annual IEEE Conference Computational Complexity (CCC), pp. 252–260 (2006)