Key points are not available for this paper at this time.
We consider several important problems for which no polynomially time bounded algorithm is known. These problems are shown to be related in that a polynomial algorithm for one implies a polynomial algorithm for the others.
Sartaj Sahni (Sun,) studied this question.