Show simple item record

dc.contributor.authorSahni, Sartajen_US
dc.date.accessioned2007-04-19T18:14:41Z
dc.date.available2007-04-19T18:14:41Z
dc.date.issued1972-07en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR72-132en_US
dc.identifier.urihttps://hdl.handle.net/1813/5987
dc.description.abstractWe 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.en_US
dc.format.extent1509233 bytes
dc.format.extent426907 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleSome Related Problems from Network Flows, Game Theory and Integer Programmingen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics