1. A linear-time algorithm for testing the truth of certain quantified boolean formulas;Aspvall;IPL,1979
2. R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proc. of the 10th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. S856–S857
3. The complexity of theorem-proving procedures;Cook,1971
4. Counting satisfying assignments in 2-SAT and 3-SAT;Dahllöf,2002
5. A deterministic (2−2/k+1)n algorithm for k-sat based on local search;Dantsin;TCS,2002