1. Alon N, Galil Z, Margalit O (1997) On the exponent of the all-pairs shortest path problem. J Comput Syst Sci 54:255–262
2. Aspvall B, Plass MF, Tarjan RE (1979) A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf Proc Lett 8(3):121–123
3. Bansal N, Raman V (1999) Upper bounds for Max Sat: further improved. In: Proceedings of ISAAC, Chennai. LNCS, vol 1741. Springer, Berlin, pp 247–258
4. Coppersmith D, Winograd S (1990) Matrix multiplication via arithmetic progressions. JSC 9(3):251–280
5. Dantsin E, Wolpert A (2006) Max SAT for formulas with constant clause density can be solved faster than in O(2
n
) time. In: Proceedings of the 9th international conference on theory and applications of satisfiability testing, Seattle. LNCS, vol 4121. Springer, Berlin, pp 266–276