DSpace Repository
Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Login
English
العربية
DSpace Home
→
Harvested articles مقالات مستوردة من مؤسسات وجامعات عالمية
→
MIT Items
→
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
Luo, Zhi-Quan.; Tsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
URI:
http://koha.mediu.edu.my:8181/xmlui/handle/1721
Date:
2013-06-05
Description:
Zhi-Quan Luo, John N. Tsitsiklis.
Bibliography: leaf 6.
Research supported by the Army Research Office under contract DAAAG-29-84-K-005
Show full item record
Files in this item
Files
Size
Format
View
There are no files associated with this item.
This item appears in the following Collection(s)
MIT Items
Search DSpace
Search DSpace
This Collection
Advanced Search
Browse
All of DSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
My Account
Login
Register