Show simple item record

On the complexity of a special basis problem in LP

dc.contributor.authorMurty, Katta G.en_US
dc.date.accessioned2006-02-03
dc.date.available2006-02-03
dc.date.issued1990en_US
dc.identifierUMR4507en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/6738
dc.format.extent7 bytes
dc.format.extent8249 bytes
dc.format.extent3366 bytes
dc.format.extent9680 bytes
dc.format.extent384465 bytes
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.subjectComputational Complexity.en_US
dc.subjectNP-complete Problems.en_US
dc.subjectLinear Programming.en_US
dc.titleOn the complexity of a special basis problem in LPen_US
dc.typeTechnical Reporten_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/6738/5/bam0399.0001.001.pdfen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/6738/4/bam0399.0001.001.txten_US
dc.owningcollnameEngineering, College of - Technical Reports


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.