dc.contributor.advisor | Munther A. Dahleh. | en_US |
dc.contributor.author | Theodosopoulos, Theodore | en_US |
dc.date.accessioned | 2005-08-15T21:26:57Z | |
dc.date.available | 2005-08-15T21:26:57Z | |
dc.date.copyright | 1993 | en_US |
dc.date.issued | 1993 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/12608 | |
dc.description | Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993. | en_US |
dc.description | Includes bibliographical references (leaves 63-65). | en_US |
dc.description.statementofresponsibility | by Theodore V. Theodosopoulos. | en_US |
dc.format.extent | 65 leaves | en_US |
dc.format.extent | 3263378 bytes | |
dc.format.extent | 3263135 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | en_US |
dc.publisher | Massachusetts Institute of Technology | en_US |
dc.rights | M.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.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
dc.subject | Electrical Engineering and Computer Science | en_US |
dc.title | Worst-case identification in l1 : algorithms and complexity | en_US |
dc.type | Thesis | en_US |
dc.description.degree | M.S. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | |
dc.identifier.oclc | 28261243 | en_US |