We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

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

Thumbnail Image
Download
Name

OR-150-86-16361283.pdf

Size

340.57 KB

Format

Adobe PDF

Checksum (MD5)

05b5f58b9820e8e9266d9937487e7988

Date Issued
1986
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 150-86
Description
Bibliography: leaf 6.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.