| dc.contributor | Luo, Zhi-Quan. | en_US |
| dc.contributor | Tsitsiklis, John N. | en_US |
| dc.contributor | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. | en_US |
| dc.date.accessioned | 2003-04-29T15:27:53Z | |
| dc.date.available | 2003-04-29T15:27:53Z | |
| dc.date.issued | 1986 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/2964 | |
| dc.description | Bibliography: leaf 6. | en_US |
| dc.description.sponsorship | Research supported by the Army Research Office under contract DAAAG-29-84-K-005 | en_US |
| dc.description.statementofresponsibility | Zhi-Quan Luo, John N. Tsitsiklis. | en_US |
| dc.format.extent | 6 leaves | en_US |
| dc.format.extent | 400199 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] | en_US |
| dc.relation.ispartofseries | LIDS-P ; 1616 | en_US |
| dc.subject.lcc | TK7855.M41 E3845 no.1616 | en_US |
| dc.title | Lower bounds on the time to compute a simple boolean function on a parallel random access machine | en_US |
