10 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- National Research University Higher School of EconomicsRU4 papers
- Russian Academy of SciencesRU3 papers
- Institute of Applied Mathematical Research of the Karelian Research Centre of the Russian Academy of Sciences1 paper
- Karelian Research CentreRU1 paper
- Qingdao UniversityCN1 paper
- Saint-Petersburg Institute of HistoryRU1 paper
Showing 1999Show all
2 papers · 1 filter
cs.DS1999★ 2 cited
A class of problems of NP to be worth to search an efficient solving algorithm
Anatoly D. Plotnikov
We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solu…
cs.LO1999
Designing SAT for HCP
Anatoly D. Plotnikov
For arbitrary undirected graph , we are designing SATISFIABILITY problem (SAT) for HCP, using tools of Boolean algebra only. The obtained SAT be the logic formulation of conditi…