| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 467066 | Applied Computing and Informatics | 2015 | 13 Pages |
Abstract
We describe a new approach for solving the satisfiability problem by geometric programming. We focus on the theoretical background and give details of the algorithmic procedure. The algorithm is provably efficient as geometric programming is in essence a polynomial problem. The correctness of the algorithm is discussed. The version of the satisfiability problem we study is exact satisfiability with only positive variables, which is known to be NP-complete.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
S. Noureddine,