Complexity issues dealing with networks that compute Boolean functions

Author(s)
Chaudhari, Upendra Vasant
Thumbnail
DownloadFull printable version (2.006Mb)
Advisor
Sanjoy K. Mitter.
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
Metadata
Show full item record
Description
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
 
Includes bibliographical references (leaf 41).
 
Date issued
1993
URI
http://hdl.handle.net/1721.1/12748
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science
Collections