One Criterion of Existence of a Himiltonian Cycle. - Anatoly D. Plotnikov (Reliab. Comput., 1998)

A class of problems of NP to be worth to search an efficient solving algorithm - Anatoly D. Plotnikov (CoRR, 1999)

Formalization of the class of problems solvable by a nondeterministic Turing machine - Anatoly D. Plotnikov (CoRR, 1999)

Designing SAT for HCP - Anatoly D. Plotnikov (CoRR, 1999)

Experimental Algorithm for the Maximum Independent Set Problem - Anatoly D. Plotnikov (CoRR, 2007)

Logical cryptoanalysis on the example of the cryptosystem DES. - Anatoly D. Plotnikov (IACR Cryptol. ePrint Arch., 2010)

Encipher of information on the basis of geometrical presentations - A. S. Petrov; Anatoly D. Plotnikov (CoRR, 2011)

On the relationship between classes P and NP - Anatoly D. Plotnikov (CoRR, 2011)

About set-theoretic properties of one-way functions - Anatoly D. Plotnikov (CoRR, 2011)

On the structure of the class NP - Anatoly D. Plotnikov (CoRR, 2013)

On a logical model of combinatorial problems. - Anatoly D. Plotnikov (CoRR, 2015)

On non-canonical solving the Satisfiability problem. - Anatoly D. Plotnikov (CoRR, 2015)

Polynomial-time algorithm for determining the graph isomorphism (v.2). - Anatoly D. Plotnikov (CoRR, 2016)

Searching isomorphic graphs. - Anatoly D. Plotnikov (CoRR, 2018)