Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)

Amir Anter, Shlomi Dolev

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

Optical architectures that use exponential space for solving instances of the (non-necessarily-binary) permanent are presented. This is the first work to specifically focus on such hard on average problems. Two architectures are suggested the first is based on programmable masks, and the second on preprepared fixed number of masks.

Original languageEnglish
Pages (from-to)891-902
Number of pages12
JournalNatural Computing
Volume9
Issue number4
DOIs
StatePublished - 1 Dec 2010

Keywords

  • Hard in average
  • Optical computing
  • Permanent

Fingerprint

Dive into the research topics of 'Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)'. Together they form a unique fingerprint.

Cite this