An optimization approach for the satisfiability problem
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 al...
Main Author: | S. Noureddine |
---|---|
Format: | Article |
Language: | English |
Published: |
Emerald Publishing
2015-01-01
|
Series: | Applied Computing and Informatics |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2210832711000494 |
Similar Items
-
An integer programming approach for the satisfiability problems.
Published: (2001) -
Exact Algorithms for Exact Satisfiability Problems
by: Dahllöf, Vilhelm
Published: (2006) -
On Some Approaches to the Solution of the Problem «Useful Proof-of-work for Blockchains»
by: Valeriy G. Durnev, et al.
Published: (2018-08-01) -
APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM
by: Konstantin I. Chukharev
Published: (2020-12-01) -
Characterizing neighborhoods favorable to local search techniques
by: Dimova, Boryana Slavcheva
Published: (2008)