Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Rainbow Sort: Sorting at the Speed of Light
Natural Computing: an international journal
Solving the Hamiltonian path problem with a light-based computer
Natural Computing: an international journal
Computing transparently: the independent sets in a graph
Natural Computing: an international journal
An optical solution for the SAT Problem
OSC'10 Proceedings of the Third international conference on Optical supercomputing
| Hi-index | 0.00 |
We design and implement highly parallel algorithms that use light as the tool of computation. An ordinary xerox machine and a box of transparencies constitutes our computer. We find the maximum in a list of n-bit numbers of arbitrary length using at most n xerox copying steps. We decide, for any graph having n vertices and m edges, whether a 3-coloring exists in at most 2n+4m copying steps. For large instances of problems such as the 3-color problem, this solution method may require the production of transparencies that display challengingly high densities of information. Our ultimate purpose here is to give hand tested 'ultraparallel' algorithmic procedures that may provide useful suggestions for future optical technologies.