Lower bounds on the computational power of an optical model of computation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Natural Computing Année : 2008

Lower bounds on the computational power of an optical model of computation

Résumé

This work is concerned with the computational complexity of a model of computation that is inspired by optical computers. We present lower bounds on the computational power of the model. Parallel time on the model is shown to be at least as powerful as sequential space. This gives one of the two inclusions that are needed to show that the model verifies the parallel computation thesis. As a corollary we find that when the model is restricted to simultaneously use polylogarithmic time and polynomial space, its power is lower bounded by the class NC. By combining these results with the known upper bounds on the model, we find that the model verifies the parallel computation thesis and, when suitably restricted, characterises NC
Fichier principal
Vignette du fichier
NACO-07.pdf (175.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01354830 , version 1 (19-08-2016)

Identifiants

Citer

Damien Woods, John Paul Gibson. Lower bounds on the computational power of an optical model of computation. Natural Computing, 2008, 7 (1), pp.95 - 108. ⟨10.1007/s11047-007-9039-7⟩. ⟨hal-01354830⟩
35 Consultations
55 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More