Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)
The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.
cs.CC↗
arXiv subjects
Sergey Kardash
Publications and source records attributed to Sergey Kardash.