2 citations · 4 across the 12 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
On non-canonical solving the Satisfiability problem
Anatoly D. Plotnikov
We study the non-canonical method for solving the Satisfiability problem which given by a formula in the form of the conjunctive normal form. The essence of this method consists in…
cs.CC2015★ 1 cited
On a logical model of combinatorial problems
Anatoly D. Plotnikov
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 th…