An optical solution for the SAT Problem

Authors:
Mihai Oltean;Oana Muntean
Affiliations:
Department of Computer Science, Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania;Department of Computer Science, Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania
Venue:
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Year:
2010

Citing 16
Cited 1

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
Ultrafast Digital-Optical Arithmetic Using Wave-Optical Computing

OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Parallel and Sequential Optical Computing

OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
A Method for Modulo Operation by Use of Spatial Parallelism

OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions

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
Computing a Solution for the Subset Sum Problem with a Light Based Device

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
Proposal for Secure Key Distribution Using Classical Optics

OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Improvement of a System for Prime Factorization Based on Optical Interferometer

OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Analysis and optimization of the TWINKLE factoring device

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
The traveling beams optical solutions for bounded NP-complete problems

FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Using light to implement parallel Boolean algebra

DLT'10 Proceedings of the 14th international conference on Developments in language theory
A light-based device for solving the hamiltonian path problem

UC'06 Proceedings of the 5th international conference on Unconventional Computation
An optical solution to the 3-SAT problem using wavelength based selectors

The Journal of Supercomputing

Lower bounds on the complexity of the wavelength-based machine

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a delay-based optical device for solving the the Satisfiability problem. The device has a graph structure which is traversed by light in order to generate a solution. The device has 2 special nodes: a start node (where the initial pulse is sent) and a destination node (where the solution is read). Multiple signals are expected at the destination. Some of them contain valid solutions and others do not. A special, time filter, is proposed in order to detect a solution. Graphical simulations show how the device works.