Complexity issues dealing with networks that compute Boolean functions

Complexity issues dealing with networks that compute Boolean functions

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.

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

Similar Items

Similar Items