Formalization of the class of problems solvable by a nondeterministic Turing machine
| dc.creator | Plotnikov, Anatoly D. | |
| dc.date | 1999-03-16 | |
| dc.date.accessioned | 2026-07-07T03:24:02Z | |
| dc.date.available | 2026-07-07T03:24:02Z | |
| dc.description | 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. We introduce two auxiliary sets that characterize the solution of the problem: the adjoint set, which contains the elements from the original set none of which can be adjoined to the already chosen solution elements; and the residual set, in which every element can be adjoined to previously chosen solution elements. In a problem without lookahead, every adjoint set can be generated by the solution algorithm effectively, in polynomial time. The main result of the study is the assertion that the NP class is identical with the class of problems without lookahead. Hence it follows that if we fail to find an effective (polynomial-time) solution algorithm for a given problem, then we need to look for an alternative formulation of the problem in set of problems without lookahead. | |
| dc.description | 10 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cs/9903012 | |
| dc.identifier | http://arxiv.org/abs/cs/9903012 | |
| dc.identifier | Cybernetics and Systems Analysis. Vol. 33, 5(1997) pp. 635-640 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33172 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Computational Complexity | |
| dc.subject | F.2.2;F.1.2 | |
| dc.title | Formalization of the class of problems solvable by a nondeterministic Turing machine | |
| dc.type | text |