2011/02/24 by Minghao Yin, Yin, Minghao
Computer Science · #Advanced Graph Theory Research #Artificial Intelligence (cs.AI) #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #cs.AI #cs.CC #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1102.4925
openalex publication_date 2011/02/24 · arxiv created 2011/03/26 · arxiv updated 2011/03/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.