Sahni, Sartaj2007-04-192007-04-191972-07http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR72-132https://hdl.handle.net/1813/5987We 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 algorrithm for the others.1509233 bytes426907 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reporttechnical report