Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Doctoral Theses
  5. The robustness of combinatorial measures of Boolean matrix complexity

The robustness of combinatorial measures of Boolean matrix complexity

Thumbnail Image
Download
Name

13915536-MIT.pdf

Description
Full printable version
Size

10.74 MB

Format

Adobe PDF

Checksum (MD5)

b4e9fbcf205642899e7b83cd1c2a4c30

Author(s)
Boyack, Stephen Wayne
Advisor(s)
Ronald L. Rivest.
Date Issued
1985
Publisher
Massachusetts Institute of Technology
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.
MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE.
Bibliography: leaves 206-212.
Subjects
Mathematics.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
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.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/15322
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.