Energy complexity of optical computations

This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching upper bounds for a transitive function

• Type: Conference
• Year: 1990
• Where: SPDP
• Authors: Akhilesh Tyagi, John H. Reif
• Keywords: Distributed And Parallel Computing, Energy Consumption, Lower Bounds, Matching Upper Bounds, SPDP 1990