Complexity issues dealing with networks that compute Boolean functions
Name
28899292-MIT.pdf
Description
Full printable version
Size
2.01 MB
Format
Adobe PDF
Checksum (MD5)
bf030dbccdcf7b1e61d27cc01bca540d
Author(s)
Chaudhari, Upendra Vasant
Advisor(s)
Sanjoy K. Mitter.
Date Issued
1993
Publisher
Massachusetts Institute of Technology
Description
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
Includes bibliographical references (leaf 41).
Subjects
Electrical Engineering and Computer Science
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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.
Persistent DSpace Link
