| dc.contributor |
Luo, Zhi-Quan |
|
| dc.contributor |
Tsitsiklis, John N. |
|
| dc.date |
2004-05-28T19:32:04Z |
|
| dc.date |
2004-05-28T19:32:04Z |
|
| dc.date |
1986 |
|
| dc.date.accessioned |
2013-10-09T02:38:49Z |
|
| dc.date.available |
2013-10-09T02:38:49Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5292 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
Zhi-Quan Luo, John N. Tsitsiklis. |
|
| dc.description |
Bibliography: leaf 6. |
|
| dc.description |
Research supported by the Army Research Office under contract DAAAG-29-84-K-005 |
|
| dc.format |
6 leaves |
|
| dc.format |
348746 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
eng |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 150-86 |
|
| dc.subject |
TK7855.M41 E3845 no.1616 |
|
| dc.title |
Lower bounds on the time to compute a simple boolean function on a parallel random access machine |
|