Список литературы
 [1] Aspvall B., Plass M. F., Tarjan R. E. A lineartime algorithm for testing the truth of certain quantified boolean formulas // Information Processing Letters, 1979, vol. 8, no. 3, pp. 121–123.
 [2] Buning H. K., Karpinski M., Flogel A. Resolution for Quantified Boolean Formulas // Information and Computation, 1995, vol. 117, no. 1, pp. 1218.

[3]
Cook S. A.
The complexity of theorem proving procedures // Proceedings of the third annual ACM symposium on Theory of computing, 1971, pp. 151–158.
 [4] Левин Л. А. Универсальные задачи перебора // Проблемы передачи информации, 1973, т. 9, №. 3, с. 115–116.
 [5] Stockmeyer L. J., Meyer A. R. Word problems requiring exponential time // In Proceedings of the 5th annual ACM symposium on Theory of computing (STOC ’73), 1973, pp. 1–9.