DeepAI
Log In Sign Up

Quantified boolean formula problem

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.

READ FULL TEXT VIEW PDF

page 1

page 2

page 3

page 4

04/06/2018

Complexity of the CNF-satisfiability problem

This paper is devoted to the complexity of the Boolean satisfiability pr...
07/11/2018

Knowledge Compilation, Width and Quantification

We generalize many results concerning the tractability of SAT and #SAT o...
05/20/2020

Information Acquisition Under Resource Limitations in a Noisy Environment

We introduce a theoretical model of information acquisition under resour...
10/02/2018

Approximating the Existential Theory of the Reals

The existential theory of the reals (ETR) consists of existentially quan...
11/02/2021

CSAT is not in P

In this paper we have to demonstrate that if we claim to have an algorit...
09/26/2011

Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas

Resolution is the rule of inference at the basis of most procedures for ...
11/11/2019

Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty

Stochastic Boolean Satisfiability (SSAT) is a logical formalism to model...

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

  • [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.