On a logical model of combinatorial problems
Computational Complexity
2016-03-02 v1
Abstract
The paper proposes a logical model of combinatorial problems, also it gives an example of a problem of the class NP that can not be solved in polynomial time on the dimension of the problem.
Keywords
Cite
@article{arxiv.1508.00094,
title = {On a logical model of combinatorial problems},
author = {Anatoly D. Plotnikov},
journal= {arXiv preprint arXiv:1508.00094},
year = {2016}
}
Comments
8 pages, 2 figures