{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/15322"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/15322","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"The robustness of combinatorial measures of Boolean matrix complexity","abstract":"Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.","abstract_html":"Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.","abstract_has_math":false,"creators":["Boyack, Stephen Wayne"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Mathematics.","school":null,"contributors":[],"advisors":["Ronald L. Rivest."],"committee_chairs":[],"committee_members":[],"year":1985,"date_issued":"1985","date_published":"1985","updated_at":"2026-07-22T22:22:08Z","subjects":["Mathematics."],"languages":["eng"],"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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/15322","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Ronald L. Rivest."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Mathematics."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Mathematics."]},{"key":"dc:creator","label":"Author","values":["Boyack, Stephen Wayne"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-08-05T21:10:08Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-08-05T21:10:08Z"]},{"key":"dc:date.issued","label":"Date","values":["1985"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/15322"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.","MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE.","Bibliography: leaves 206-212."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["The robustness of combinatorial measures of Boolean matrix complexity"]}]}],"canonical_facts":{"dc:contributor.advisor":["Ronald L. Rivest."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Mathematics."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Mathematics."],"dc:creator":["Boyack, Stephen Wayne"],"dc:date.accessioned":["2005-08-05T21:10:08Z"],"dc:date.available":["2005-08-05T21:10:08Z"],"dc:date.issued":["1985"],"dc:description":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.","MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE.","Bibliography: leaves 206-212."],"dc:description.degree":["Ph.D."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/15322"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Mathematics."],"dc:title":["The robustness of combinatorial measures of Boolean matrix complexity"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:08Z"}