Advanced Search
DSpace@MIT

Lower bounds on the time to compute a simple boolean function on a parallel random access machine

Research and Teaching Output of the MIT Community

Lower bounds on the time to compute a simple boolean function on a parallel random access machine

Download
Author: Luo, Zhi-Quan; Tsitsiklis, John N.
Publisher: Massachusetts Institute of Technology, Operations Research Center
Date Issued: 1986
Description:
Bibliography: leaf 6.
URI: http://hdl.handle.net/1721.1/5292
Series/Report no.: Operations Research Center Working Paper;OR 150-86
Keywords: TK7855.M41 E3845 no.1616

Show full item metadata

Files in this item

Name Size Format Description
OR-150-86-16361283.pdf 340.5Kb PDF

This item appears in the following Collection(s)

MIT-Mirage