1. On space-efficient algorithms for certain NP-complete problems;Ferreira;Theoret. Comput. Sci.,1993
2. Computers and Intractability;Garey,1979
3. E.A. Hirsch, Two new upper bounds for SAT, In Proc. Ninth ACM-SIAM Symp. on Discrete Algorithms, January 1998, p. 512–530.
4. An O(20.304n) algorithm for solving maximum independent set problem;Jian;IEEE Trans. Commun.,1986
5. O. Kullmann, H. Luckhardt, Deciding propositional tautologies: algorithms and their complexity, Unpublished manuscript, 1997.