Show simple item record

Complexity issues dealing with networks that compute Boolean functions

dc.contributor.advisorSanjoy K. Mitter.en_US
dc.contributor.authorChaudhari, Upendra Vasanten_US
dc.date.accessioned2005-08-15T22:37:02Z
dc.date.available2005-08-15T22:37:02Z
dc.date.copyright1993en_US
dc.date.issued1993en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/12748
dc.descriptionThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.en_US
dc.descriptionIncludes bibliographical references (leaf 41).en_US
dc.description.statementofresponsibilityby Upendra Vasant Chaudhari.en_US
dc.format.extent41 leavesen_US
dc.format.extent2104621 bytes
dc.format.extent2104381 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.subjectElectrical Engineering and Computer Scienceen_US
dc.titleComplexity issues dealing with networks that compute Boolean functionsen_US
dc.typeThesisen_US
dc.description.degreeM.S.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc28899292en_US


Files in this item

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

This item appears in the following Collection(s)

Show simple item record