2 citations · 4 across the 12 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
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…
cs.CC2013
On the structure of the class NP
Anatoly D. Plotnikov
A new class UF of problems is introduced, strictly included in the class NP, which arises in the analysis of the time verifying the intermediate results of computations. The implic…
cs.CC2011
About set-theoretic properties of one-way functions
Anatoly D. Plotnikov
We investigate the problem of cryptanalysis as a problem belonging to the class NP. A class of problems UF is defined for which the time constructing any feasible solution is polyn…