Oriental Journal of Computer Science and Technology

Open Access Open Access  Restricted Access Subscription Access

Approach To Solving K-sat Problem Based On Reduction Thereof to the Covering Problem


Affiliations
1 Ukrainian State Academy of Railway Transport, 61050, 7, Feuerbach Square, Kharkov, Ukraine
2 "Stalenergo" Scientific-Production Enterprise, 61105, 9, Fedorenko St., Kharkov, Ukraine
 

We propose an exact polynomial-time algorithm for solving SAT the problem.

Keywords

SAT Problem, Polynomial Reducibility.
User
Notifications
Font Size

Abstract Views: 240

PDF Views: 0




  • Approach To Solving K-sat Problem Based On Reduction Thereof to the Covering Problem

Abstract Views: 240  |  PDF Views: 0

Authors

S. V. Listrovoy
Ukrainian State Academy of Railway Transport, 61050, 7, Feuerbach Square, Kharkov, Ukraine
А. V. Sidorenko
"Stalenergo" Scientific-Production Enterprise, 61105, 9, Fedorenko St., Kharkov, Ukraine

Abstract


We propose an exact polynomial-time algorithm for solving SAT the problem.

Keywords


SAT Problem, Polynomial Reducibility.