Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Bibliography: leaf 6.
| Other Authors: | |
|---|---|
| Language: | eng |
| Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/5292 |
| _version_ | 1826212919176593408 |
|---|---|
| author2 | Luo, Zhi-Quan |
| author_facet | Luo, Zhi-Quan |
| collection | MIT |
| description | Bibliography: leaf 6. |
| first_indexed | 2024-09-23T15:40:14Z |
| id | mit-1721.1/5292 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T15:40:14Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/52922019-04-12T08:07:40Z Lower bounds on the time to compute a simple boolean function on a parallel random access machine Luo, Zhi-Quan Tsitsiklis, John N. TK7855.M41 E3845 no.1616 Bibliography: leaf 6. Research supported by the Army Research Office under contract DAAAG-29-84-K-005 Zhi-Quan Luo, John N. Tsitsiklis. 2004-05-28T19:32:04Z 2004-05-28T19:32:04Z 1986 http://hdl.handle.net/1721.1/5292 eng Operations Research Center Working Paper;OR 150-86 6 leaves 348746 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | TK7855.M41 E3845 no.1616 Lower bounds on the time to compute a simple boolean function on a parallel random access machine |
| title | Lower bounds on the time to compute a simple boolean function on a parallel random access machine |
| title_full | Lower bounds on the time to compute a simple boolean function on a parallel random access machine |
| title_fullStr | Lower bounds on the time to compute a simple boolean function on a parallel random access machine |
| title_full_unstemmed | Lower bounds on the time to compute a simple boolean function on a parallel random access machine |
| title_short | Lower bounds on the time to compute a simple boolean function on a parallel random access machine |
| title_sort | lower bounds on the time to compute a simple boolean function on a parallel random access machine |
| topic | TK7855.M41 E3845 no.1616 |
| url | http://hdl.handle.net/1721.1/5292 |