On a logical model of combinatorial problems
arXiv:1508.00094 · doi:10.4236/oalib.1101479
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.
arXiv comment8 pages, 2 figures