Show simple item record

The robustness of combinatorial measures of Boolean matrix complexity

dc.contributor.advisorRonald L. Rivest.en_US
dc.contributor.authorBoyack, Stephen Wayneen_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Mathematics.en_US
dc.date.accessioned2005-08-05T21:10:08Z
dc.date.available2005-08-05T21:10:08Z
dc.date.copyright1985en_US
dc.date.issued1985en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/15322
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.en_US
dc.descriptionMICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE.en_US
dc.descriptionBibliography: leaves 206-212.en_US
dc.description.statementofresponsibilityStephen Wayne Boyack.en_US
dc.format.extent212 leavesen_US
dc.format.extent11259679 bytes
dc.format.extent11259434 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.subjectMathematics.en_US
dc.titleThe robustness of combinatorial measures of Boolean matrix complexityen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.oclc13915536en_US


Files in this item

Thumbnail
Name:
13915536-MIT.pdf
Size:
10.73Mb
Format:
PDF
Description:
Full printable version
View/Open

This item appears in the following Collection(s)

Show simple item record