Nanotechnology based optical solution for NP-hard problems

Authors:
Eyal Cohen;Shlomi Dolev;Sergey Frenkel;Rami Puzis;Michael Rosenblit
Affiliations:
Department of Computer Science, Ben Gurion University of the Negev, Israel;Department of Computer Science, Ben Gurion University of the Negev, Israel;Institute of Informatics Problems, Russian Academy of Science, Russia;Deutsche Telekom Laboratories, Ben Gurion University of the Negev, Israel;Ilze Katz Institute for Nanoscale Science & Technology, Ben Gurion University of the Negev, Israel
Venue:
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Year:
2010

Citing 14
Cited 0

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
Machine models and simulations

Handbook of theoretical computer science (vol. A)
Charles Babbage: Pioneer of the Modern Computer

Charles Babbage: Pioneer of the Modern Computer
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances

Computational Complexity
The computability and complexity of optical beam tracing

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Electro-Optical DSP of Tera Operations per Second and Beyond (Extended Abstract)

OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Solving the subset-sum problem with a light-based device

Natural Computing: an international journal
Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)

Natural Computing: an international journal
Optical computing and computational complexity

UC'06 Proceedings of the 5th international conference on Unconventional Computation
A light-based device for solving the hamiltonian path problem

UC'06 Proceedings of the 5th international conference on Unconventional Computation
Lower bounds on the computational power of an optical model of computation

UC'05 Proceedings of the 4th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a design for a micro optical architecture for solving instances of NP-hard problems, using nano-technology. The architecture is using pre-processed masks to block some of the light propagating through them. We demonstrate how such a device could be used to solve instances of Hamiltoniancycle and the Permanent problems.