Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Plotnikov, A. D."'
Autor:
Plotnikov, Anatoly D.
Publikováno v:
Transactions on Networks and Communications, Volume 5, No. 5, ISSN: 2054 -7420 (2017)
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomo
Externí odkaz:
http://arxiv.org/abs/1802.03611
Autor:
Plotnikov, Anatoly D.
Publikováno v:
American Journal of Information Science and Computer Engineering, Vol. 3, No. 6, 2017, pp. 71-76
We develop the methodology of positioning graph vertices relative to each other to solve the problem of determining isomorphism of two undirected graphs. Based on the position of the vertex in one of the graphs, it is determined the corresponding ver
Externí odkaz:
http://arxiv.org/abs/1610.05725
Autor:
Plotnikov, Anatoly D.
Publikováno v:
International Journal of Automation, Control and Intelligent Systems, Vol. 1, No. 3, September 2015, Pub. Date: Aug. 5, 2015, p.73-76
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 counting the number of tuples of Boolean variables, on which at least
Externí odkaz:
http://arxiv.org/abs/1508.00123
Autor:
Plotnikov, Anatoly D.
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 the problem.
Comment: 8 pages, 2 figures
Comment: 8 pages, 2 figures
Externí odkaz:
http://arxiv.org/abs/1508.00094
Autor:
Plotnikov, Anatoly D.
Publikováno v:
On the structure of the class NP. Computer Communication & Collaboration (2013) 1: 19-23
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 implications of the introduction of this class are considered. First of all,
Externí odkaz:
http://arxiv.org/abs/1304.1307
Autor:
Plotnikov, Anatoly D.
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 polynomial. The properties of the problems of NP, which may be one-way func
Externí odkaz:
http://arxiv.org/abs/1110.3189
Autor:
Plotnikov, Anatoly D.
Publikováno v:
On the relationship between classes P and NP. J. Comput. Sci., 8, 2012: p.1036-1040
In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small changes in i
Externí odkaz:
http://arxiv.org/abs/1109.5531
Autor:
Petrov, A. S., Plotnikov, A. D.
In this paper, we examine a ciphertext on the basis of using geometrical objects. Each symbol normative alphabet is determined as a point on the plane. We consider possible ways for presentation of these points.
Comment: 7 pages
Comment: 7 pages
Externí odkaz:
http://arxiv.org/abs/1103.5199
Autor:
Plotnikov, Anatoly D.
Publikováno v:
Cybernetics and Systems Analysis: Volume 48, Issue 5 (2012), Page 673-680
We develop an experimental algorithm for the exact solving of the maximum independent set problem. The algorithm consecutively finds the maximal independent sets of vertices in an arbitrary undirected graph such that the next such set contains more e
Externí odkaz:
http://arxiv.org/abs/0706.3565
Autor:
Plotnikov, Anatoly D.
Publikováno v:
About the finding of independent vertices of a graph, Journal "Kibernetika", No. 1, 1989, p. 119 - 121
We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is formulated which
Externí odkaz:
http://arxiv.org/abs/cs/0003078