Optical computing: a survey for computer scientists
Optical computing: a survey for computer scientists
Optical computer architectures: the application of optical concepts to next generation computers
Optical computer architectures: the application of optical concepts to next generation computers
Charles Babbage: Pioneer of the Modern Computer
Charles Babbage: Pioneer of the Modern Computer
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Factoring Large Numbers with the Twinkle Device (Extended Abstract)
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
The computability and complexity of optical beam tracing
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Ultrafast Digital-Optical Arithmetic Using Wave-Optical Computing
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Electro-Optical DSP of Tera Operations per Second and Beyond (Extended Abstract)
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Optical Designs for Non-deterministic Turing Machines
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Evolutionary Design of Graph-Based Structures for Optical Computing
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
An Optical Wavelength-Based Solution to the 3-SAT Problem
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Natural Computing: an international journal
An optical solution for the SAT Problem
OSC'10 Proceedings of the Third international conference on Optical supercomputing
An optical solution to the 3-SAT problem using wavelength based selectors
The Journal of Supercomputing
| Hi-index | 0.00 |
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that simultaneously examine the different possible paths. The other approach uses a pre-processing stage in which O(n2) masks are constructed, each representing a different edge in the graph. The choice and combination of the appropriate (small) subset of these masks yields the solution. The solution is rejected in cases where the combination of these masks totally blocks the light and accepted otherwise. We present detailed designs for basic primitives of the optical processor. We propose designs for solving Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, and 3D-matching.