Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)
Computational Complexity
2012-06-01 v2 Data Structures and Algorithms
Abstract
The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.
Cite
@article{arxiv.1108.0408,
title = {Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)},
author = {Sergey Kardash},
journal= {arXiv preprint arXiv:1108.0408},
year = {2012}
}