32 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
Showing cs.CCShow all
2 papers · 1 filter
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…