Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2964| Title: | Lower bounds on the time to compute a simple boolean function on a parallel random access machine |
| Authors: | Luo, Zhi-Quan. Tsitsiklis, John N. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Keywords: | TK7855.M41 E3845 no.1616 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] |
| Description: | Zhi-Quan Luo, John N. Tsitsiklis. Bibliography: leaf 6. Research supported by the Army Research Office under contract DAAAG-29-84-K-005 |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/2964 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
