Complexity issues dealing with networks that compute Boolean functions

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993. === Includes bibliographical references (leaf 41). === by Upendra Vasant Chaudhari. === M.S.

Bibliographic Details
Main Author:	Chaudhari, Upendra Vasant
Other Authors:	Sanjoy K. Mitter.
Format:	Others
Language:	English
Published:	Massachusetts Institute of Technology 2005
Subjects:	Electrical Engineering and Computer Science
Online Access:	http://hdl.handle.net/1721.1/12748

id	ndltd-MIT-oai-dspace.mit.edu-1721.1-12748
record_format	oai_dc
spelling	ndltd-MIT-oai-dspace.mit.edu-1721.1-127482019-05-02T16:12:34Z Complexity issues dealing with networks that compute Boolean functions Chaudhari, Upendra Vasant Sanjoy K. Mitter. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science Electrical Engineering and Computer Science Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993. Includes bibliographical references (leaf 41). by Upendra Vasant Chaudhari. M.S. 2005-08-15T22:37:02Z 2005-08-15T22:37:02Z 1993 1993 Thesis http://hdl.handle.net/1721.1/12748 28899292 eng 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 41 leaves 2104621 bytes 2104381 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
collection	NDLTD
language	English
format	Others
sources	NDLTD
topic	Electrical Engineering and Computer Science
spellingShingle	Electrical Engineering and Computer Science Chaudhari, Upendra Vasant Complexity issues dealing with networks that compute Boolean functions
description	Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993. === Includes bibliographical references (leaf 41). === by Upendra Vasant Chaudhari. === M.S.
author2	Sanjoy K. Mitter.
author_facet	Sanjoy K. Mitter. Chaudhari, Upendra Vasant
author	Chaudhari, Upendra Vasant
author_sort	Chaudhari, Upendra Vasant
title	Complexity issues dealing with networks that compute Boolean functions
title_short	Complexity issues dealing with networks that compute Boolean functions
title_full	Complexity issues dealing with networks that compute Boolean functions
title_fullStr	Complexity issues dealing with networks that compute Boolean functions
title_full_unstemmed	Complexity issues dealing with networks that compute Boolean functions
title_sort	complexity issues dealing with networks that compute boolean functions
publisher	Massachusetts Institute of Technology
publishDate	2005
url	http://hdl.handle.net/1721.1/12748
work_keys_str_mv	AT chaudhariupendravasant complexityissuesdealingwithnetworksthatcomputebooleanfunctions
_version_	1719036229494767616

Complexity issues dealing with networks that compute Boolean functions

Similar Items