3 papers
cs.DS1999
Formalization of the class of problems solvable by a nondeterministic Turing machine
Anatoly D. Plotnikov
The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements.…
cs.DS1999
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…