A class of problems of NP to be worth to search an efficient solving algorithm
| dc.creator | Plotnikov, Anatoly D. | |
| dc.date | 1999-03-11 | |
| dc.date.accessioned | 2026-07-07T03:24:01Z | |
| dc.date.available | 2026-07-07T03:24:01Z | |
| dc.description | 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 solution of size $k$ can be extended into a partial solution of size $k+1$ in polynomial time. It is defined an unique class problems to be worth to search an efficient solving algorithm. The problems, which are outside of this class, are inherently exponential. We show that the Hamiltonian cycle problem is inherently exponential. | |
| dc.description | 9 pages, 1 figures | |
| dc.identifier | https://arxiv.org/abs/cs/9903010 | |
| dc.identifier | http://arxiv.org/abs/cs/9903010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33170 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2;G.2.1;G.2.2 | |
| dc.title | A class of problems of NP to be worth to search an efficient solving algorithm | |
| dc.type | text |