The traveling beams optical solutions for bounded NP-complete problems

Shlomi Dolev, Hen Fitoussi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

25 Scopus citations


Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that simultaneously examine the different possible paths. The other approach uses a pre-processing stage in which O(n2) masks are constructed, each representing a different edge in the graph. The choice and combination of the appropriate (small) subset of these masks yields the solution. The solution is rejected in cases where the combination of these masks totally blocks the light and accepted otherwise. We present detailed designs for basic primitives of the optical processor. We propose designs for solving Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, and 3D-matching.

Original languageEnglish
Title of host publicationFun with Algorithms - 4th International Conference, FUN 2007, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540729136
StatePublished - 1 Jan 2007
Event4th International Conference on Fun with Algorithms, FUN 2007 - Castiglioncello, Italy
Duration: 3 Jun 20075 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4475 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Conference on Fun with Algorithms, FUN 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'The traveling beams optical solutions for bounded NP-complete problems'. Together they form a unique fingerprint.

Cite this