Show simple item record

dc.contributor.advisorMunther A. Dahleh.en_US
dc.contributor.authorTheodosopoulos, Theodoreen_US
dc.date.accessioned2005-08-15T21:26:57Z
dc.date.available2005-08-15T21:26:57Z
dc.date.copyright1993en_US
dc.date.issued1993en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/12608
dc.descriptionThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.en_US
dc.descriptionIncludes bibliographical references (leaves 63-65).en_US
dc.description.statementofresponsibilityby Theodore V. Theodosopoulos.en_US
dc.format.extent65 leavesen_US
dc.format.extent3263378 bytes
dc.format.extent3263135 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectElectrical Engineering and Computer Scienceen_US
dc.titleWorst-case identification in l1 : algorithms and complexityen_US
dc.typeThesisen_US
dc.description.degreeM.S.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center
dc.identifier.oclc28261243en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record