Show simple item record

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

dc.contributorLuo, Zhi-Quanen_US
dc.contributorTsitsiklis, John N.en_US
dc.date.accessioned2004-05-28T19:32:04Z
dc.date.available2004-05-28T19:32:04Z
dc.date.issued1986en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5292
dc.descriptionBibliography: leaf 6.en_US
dc.description.sponsorshipResearch supported by the Army Research Office under contract DAAAG-29-84-K-005en_US
dc.description.statementofresponsibilityZhi-Quan Luo, John N. Tsitsiklis.en_US
dc.format.extent6 leavesen_US
dc.format.extent348746 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesOperations Research Center Working Paper;OR 150-86en_US
dc.subject.lccTK7855.M41 E3845 no.1616en_US
dc.titleLower bounds on the time to compute a simple boolean function on a parallel random access machineen_US
dc.typeWorking Paper
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center


Files in this item

Thumbnail
Name:
OR-150-86-16361283.pdf
Size:
340.5Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record