Worst-Case Upper Bound for (1, 2)-QSAT

Details Worst-Case Upper Bound for (1, 2)-QSAT Worst-Case Upper Bound for (1, 2)-QSAT

2011-02-24

arxiv.org/abs/1102.4925v2

Computer Science

Artificial Intelligence

Scientific paper

The rigorous theoretical analysis of the algorithm for a subclass of QSAT, i.e. (1, 2)-QSAT, has been proposed in the literature. (1, 2)-QSAT, first introduced in SAT'08, can be seen as quantified extended 2-CNF formulas. Until now, within our knowledge, there exists no algorithm presenting the worst upper bound for (1, 2)-QSAT. Therefore in this paper, we present an exact algorithm to solve (1, 2)-QSAT. By analyzing the algorithms, we obtain a worst-case upper bound O(1.4142m), where m is the number of clauses.

Affiliated with

Also associated with

No associations

Rating

Worst-Case Upper Bound for (1, 2)-QSAT does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Worst-Case Upper Bound for (1, 2)-QSAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Worst-Case Upper Bound for (1, 2)-QSAT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86295