The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An optical model of computation
Theoretical Computer Science
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Solving the Hamiltonian path problem with a light-based computer
Natural Computing: an international journal
Lower bounds on the computational power of an optical model of computation
Natural Computing: an international journal
Parallel and Sequential Optical Computing
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
The traveling beams optical solutions for bounded NP-complete problems
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
An analysis of SAT-based model checking techniques in an industrial environment
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
OSC'10 Proceedings of the Third international conference on Optical supercomputing
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
A new light-based solution to the Hamiltonian path problem
Future Generation Computer Systems
Lower bounds on the complexity of the wavelength-based machine
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
| Hi-index | 0.00 |
The NP-complete is a class of complexity including many real-world problems. Although many efforts made to find efficient solutions to NP-complete problems, no such a solution having polynomial complexity of used resources is found yet. Optical computing, as a branch of unconventional computing, provides new capabilities to solve NP-complete problems, using physical properties of light such as high parallelism nature of it. Some optical approaches to solve NP-complete problems in efficient manner are already provided, such as delaying the light motion, using optical masks, and using continuous space machines. In this paper, a new optical approach, using wide range of wavelengths exist in a light ray, is provided to solve the 3-SAT problem, a well-known NP-complete problem, in polynomial time. Each instance of the 3-SAT problem is a CNF-formula consisting m clauses be composed of n boolean variables. The question is if there is a value-assignment to the boolean variables which satisfies the formula or not. In the method provided in this paper, wavelengths presented in a light ray are considered as possible value-assignments to n variables. Basic optical devices such as prisms and mirrors are used to discriminate proper wavelengths which satisfy the CNF-formal. The method uses exponential size blocks to drop improper wavelengths, which may be constructed in a preprocessing phase and be used in many 3-SAT problem instances. After the preprocessing phase, the method takes O (m ) time and exponential number of different wavelengths in light rays to find the answer of each 3-SAT problem instance.