Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

UC
2005
Springer

favoriteEmaildiscussreport

99views Applied Computing» more UC 2005»

Lower Bounds on the Computational Power of an Optical Model of Computation

13 years 10 months ago

Lower Bounds on the Computational Power of an Optical Model of Computation

Download www.dna.caltech.edu

We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus giving one of the two inclusions that are necessary to show that the model veriﬁes the parallel computation thesis. Furthermore we show that C2-CSMs that simultaneously use polynomial space and polylogarithmic time decide at least the class NC.

Damien Woods, J. Paul Gibson

Real-time Traffic

Lower Bounds | Optical Model | Parallel Computation Thesis | UC 2005 |

claim paper

Related Content

» Upper Bounds on the Computational Power of an Optical Model of Computation

» Randomized computations on large data sets tight lower bounds

» Energy complexity of optical computations

» Lower Bounds of Computational Power of a Synaptic Calculus

» Strong Lower Bounds for a Survivable Network Design Problem

» Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reach...

» Algebraic Lower Bounds for Computing on Encrypted Data

» A tight lower bound for parity in noisy communication networks

» Lower and upper bounds for a twolevel hierarchical location problem in computer networks

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	UC
Authors	Damien Woods, J. Paul Gibson

Comments (0)