Solving NP-complete problems with delayed signals: an overview of current research directions
Abstract
In this paper we summarize the existing principles for building unconventional computing devices that involve delayed signals for encoding solutions to NP-complete problems. We are interested in the following aspects: the properties of the signal, the operations performed within the devices, some components required for the physical implementation, precision required for correctly reading the solution and the decrease in the signal's strength. Six problems have been solved so far by using the above enumerated principles: Hamiltonian path, travelling salesman, bounded and unbounded subset sum, Diophantine equations and exact cover. For the hardware implementation several types of signals can be used: light, electric power, sound, electro-magnetic etc.
Cite
@article{arxiv.1509.02673,
title = {Solving NP-complete problems with delayed signals: an overview of current research directions},
author = {Mihai Oltean and Oana Muntean},
journal= {arXiv preprint arXiv:1509.02673},
year = {2015}
}
Comments
in Proceedings of 1st international workshop on Optical SuperComputing, LNCS 5172, pp. 115-128, Springer-Verlag, 2008, more info at: http://www.cs.ubbcluj.ro/~moltean/optical