Quantified boolean formula problem
Grigoriy V. Bokov
TL;DR
This paper presents a simple deterministic algorithm that efficiently decides the truth of quantified boolean formulas within polynomial time bounds.
Contribution
The paper introduces a new polynomial-time algorithm for the quantified boolean formula problem, improving understanding of its computational complexity.
Findings
Algorithm runs in O(|F|^4) time
Decides truth of quantified boolean formulas efficiently
Advances complexity analysis of QBF problem
Abstract
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 , stops in time bounded by and answers yes if is true and no otherwise.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Complexity and Algorithms in Graphs