Quantified boolean formula problem

07/18/2018 ∙ by Grigoriy V. Bokov, et al. ∙ Lomonosov Moscow State University 0

This paper is devoted to the complexity of the quantified boolean formula problem. We describe a simple deterministic algorithm that, for a given quantified boolean formula F, stops in time bounded by O(|F|^4) and answers yes if F is true and no otherwise.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

Список литературы

  • [1] Aspvall B., Plass M. F., Tarjan R. E. A linear-time 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. 12-18.
  • [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.