Abstract Views :250 |
PDF Views:0
Authors
Affiliations
1 Ukrainian State Academy of Railway Transport, 61050, 7, Feuerbach Square, Kharkov, UA
2 "Stalenergo" Scientific-Production Enterprise, 61105, 9, Fedorenko St., Kharkov, UA
Source
Oriental Journal of Computer Science and Technology, Vol 8, No 3 (2015), Pagination: 255-269
Abstract
We propose an exact polynomial-time algorithm for solving SAT the problem.
Keywords
SAT Problem, Polynomial Reducibility.
Full Text
