3 citations · 3 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2012★ 3 cited
On the principal impossibility to prove P=NP
Natalia L. Malinina
The material of the article is devoted to the most complicated and interesting problem -- a problem of P = NP?. This research was presented to mathematical community in Hyderabad d…
cs.CC2010
On the solution of the Graph Isomorphism Problem Part 1
Leonid Malinin, Natalia Malinina
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism o…