MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Author(s)
Luo, Zhi-Quan; Tsitsiklis, John N.
Thumbnail
DownloadOR-150-86-16361283.pdf (340.5Kb)
Metadata
Show full item record
Description
Bibliography: leaf 6.
Date issued
1986
URI
http://hdl.handle.net/1721.1/5292
Department
Massachusetts Institute of Technology. Operations Research Center
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 150-86

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.