Anatoly D. Plotnikov

According to our database1, Anatoly D. Plotnikov authored at least 14 papers between 1998 and 2018.

Collaborative distances:
  • no known Dijkstra number2.
  • no known Erdős number3.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2018
Searching isomorphic graphs.
CoRR, 2018

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

2015
On non-canonical solving the Satisfiability problem.
CoRR, 2015

On a logical model of combinatorial problems.
CoRR, 2015

2013
On the structure of the class NP
CoRR, 2013

2011
About set-theoretic properties of one-way functions
CoRR, 2011

On the relationship between classes P and NP
CoRR, 2011

Encipher of information on the basis of geometrical presentations
CoRR, 2011

2010
Logical cryptoanalysis on the example of the cryptosystem DES.
IACR Cryptol. ePrint Arch., 2010

2007
Experimental Algorithm for the Maximum Independent Set Problem
CoRR, 2007

1999
Designing SAT for HCP
CoRR, 1999

Formalization of the class of problems solvable by a nondeterministic Turing machine
CoRR, 1999

A class of problems of NP to be worth to search an efficient solving algorithm
CoRR, 1999

1998
One Criterion of Existence of a Himiltonian Cycle.
Reliab. Comput., 1998


  Loading...