A class of problems of NP to be worth to search an efficient solving algorithm

Details A class of problems of NP to be worth to search an efficient solving algorithm A class of problems of NP to be worth to search an efficient solving algorithm

1999-03-11

arxiv.org/abs/cs/9903010v1

Computer Science

Data Structures and Algorithms

9 pages, 1 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A class of problems of NP to be worth to search an efficient solving algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A class of problems of NP to be worth to search an efficient solving algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A class of problems of NP to be worth to search an efficient solving algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267291