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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 777-788

  Woods, Damien ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS;

COMPUTATIONAL POWER; OPTICAL MODEL; POLYLOGARITHMIC TIME; SEQUENTIAL SPACE;

COMPUTATION THEORY;

EID: 33744954815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_78     Document Type: Conference Paper

References (23)

1. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural complexity, vols I and II. EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1988.
2. R. B. Boppana and M. Sipser. The complexity of finite functions. Volume A of van Leeuwen [19], 1990.
3. A. Borodin, On relating time and space to size and depth. SIAM Journal on Computing, 6(4):733-744, Dec, 1977.
4. A. K. Chandra and L. J. Stockmeyer. Alternation. In FOCS 1976, pages 98-108,: Houston, Texas, Oct. IEEE.
5. M. L. Furst, J. B. Saxe, and M. Sipser. Parity, circuits and the polynomial-time hierarchy. Mathematical Systems Theory, 17(l):13-27, 1984.
6. L. M. Goldschlager. Synchronous parallel computation. PhD thesis, University of Toronto, Computer Science Department, Dec. 1977.
7. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to parallel computation: P-completeness theory. Oxford university Press, Oxford, 1995.
8. R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. Volume A of van Leeuwen [19], 1990.
9. V. Krapchenko. Asymptotic estimation of addition time of a parallel adder. Syst. Theory Res., 19:105-222, 1970.
10. R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831-838, 1980.
11. T. J. Naughton. Continuous-space model of computation is Turing universal. In Critical Technologies for the Future of Computing, Proc. SPIE vol. 4109, pages 121-128, Aug. 2000.
12. T. J. Naughton. A model of computation for Fourier optical processors. In Optics in Computing 2000, Proc. SPIE vol. 4089, pages 24-34, Quebec, June 2000.
13. rd Int. Conference, volume 2055 of LNCS, pages 288-299, Chişinǎu, 2001. Springer.
14. I. Parberry. Parallel complexity theory. Wiley, 1987.
15. J. E. Savage. Models of computation: Exploring the power of computing. Addison Wesley, 1998.
16. A. Schönhage and V. Strassen. Schnelle multiplikation grosser zahlen. Computing, 7(3-4):281-292, 1971.
17. J. Simon. On feasible numbers. In Proc. 9th Annual ACM Symposium on Theory of Computing, pages 195-207. ACM, 1977.
18. P. van Emde Boas. Machine models and simulations. Volume A of van Leeuwen [19], 1990.
19. J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume A Elsevier, Amsterdam, 1990.
20. D. Woods. Computational complexity of an optical model of computation. PhD thesis, National University of Ireland, Maynooth, 2005.
21. D. Woods and J. P. Gibson. Complexity of continuous space machine operations. In New Computational Paradigms, First Conference on Computability in Europe, volume 3526 of LNCS, pages 540-551, Amsterdam, June 2005. Springer.
22. D. Woods and J. P. Gibson. Lower bounds on the computational power of an optical model of computation. In Fourth International Conference on Unconventional Computation, volume 3699 of LNCS, pages 237-250, Sevilla, Oct. 2005. Springer.
23. D. Woods and T. J. Naughton. An optical model of computation. Theoretical Computer Science, 334(l-3):227-258, Apr. 2005.