Theses and Dissertations - UTB/UTPA

Date of Award


Document Type


Degree Name

Master of Science (MS)


Computer Science

First Advisor

Dr. Yang Liu

Second Advisor

Dr. Zhixiang Chen

Third Advisor

Dr. Bin Fu


The SAT problem is the classical NP-complete problem. In the past, many methods have been proposed for solving this problem. We investigated a new method for 3-SAT problem, which is a fixed parameterized algorithm proposed in this paper first. This method uses a fixed parameter k, where k is the number of true values in an assignment for checking whether the formula is satisfied or not. The complexity of our algorithm is O(3k ), which is exponentially independent of the number of variables. Theoretical analysis shows that when k is small, this method has smaller search space and higher speed.


Copyright 2010 Yi Gao. All Rights Reserved.

Granting Institution

University of Texas-Pan American