We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus giving one of the two inclusions that are necessary to show that the model verifies the parallel computation thesis. Furthermore we show that C2-CSMs that simultaneously use polynomial space and polylogarithmic time decide no more than the class NC. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Woods, D. (2005). Upper bounds on the computational power of an optical model of computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 777–788). https://doi.org/10.1007/11602613_78
Mendeley helps you to discover research relevant for your work.