Share Email Print

Proceedings Paper

Space-time complexity in optical computing
Author(s): H. John Caulfield
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Given certain simple and well defined operations and complexity measures, the product of spatial complexity with temporal complexity must exceed a certain minimum problem complexity if that processor is to solve that problem. Some optical processors violate that condition in a favorable direction (anomalously small temporal complexity). We next extend the requirement to embrace those optical processors. In its final form, the theorem requires that the product of spatial, temporal, and fanin complexities equal or exceed the problem complexity.

Paper Details

Date Published: 27 December 1990
PDF: 7 pages
Proc. SPIE 1347, Optical Information Processing Systems and Architectures II, (27 December 1990); doi: 10.1117/12.23444
Show Author Affiliations
H. John Caulfield, Univ. of Alabama in Huntsville (United States)

Published in SPIE Proceedings Vol. 1347:
Optical Information Processing Systems and Architectures II
Bahram Javidi, Editor(s)

© SPIE. Terms of Use
Back to Top