Solving the Hamiltonian path problem with a light-based computer
TLDR
This paper proposes a special computational device which uses light rays for solving the Hamiltonian path problem on a directed graph and shows that the proposed device can solve small and medium instances of the problem in reasonable time.Abstract:
In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it by following the routes given by the connections between nodes. In each node the rays are uniquely marked so that they can be easily identified. At the destination node we will search only for particular rays that have passed only once through each node. We show that the proposed device can solve small and medium instances of the problem in reasonable time.read more
Citations
More filters
Journal ArticleDOI
Intrinsic optimization using stochastic nanomagnets
TL;DR: In this article, the authors present a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state.
Journal ArticleDOI
Intrinsic optimization using stochastic nanomagnets
TL;DR: A hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state is drawn attention.
Journal ArticleDOI
Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states.
TL;DR: In this article, an experimental demonstration of an actual memcomputing architecture that solves the NP-complete version of the subset sum problem in only one step and is composed of a number of memprocessors that scales linearly with the size of the problem.
Journal ArticleDOI
An optical fiber network oracle for NP-complete problems
Kan Wu,F. Javier García de Abajo,F. Javier García de Abajo,Cesare Soci,Perry Ping Shum,Nikolay I. Zheludev,Nikolay I. Zheludev +6 more
TL;DR: It is argued that the optical oracle could solve this NP-complete problem hundreds times faster than brute-force computing, discuss its secure communication applications, and propose possible implementation in silicon photonics and plasmonic networks.
Journal ArticleDOI
Unconventional computing
TL;DR: It is arguable that in this second decade of the 21 century, the authors are starting to see serious opportunities for rethinking how they may compute, and the limitations of conventional use of silicon technology may be overcome with new materials and with new architectural designs as is beginning to be apparent with the new IBM Neural chip.
References
More filters
Some methods for classification and analysis of multivariate observations
TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.