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

Amir Anter; Shlomi Dolev

doi:10.1007/s11047-009-9168-2

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

Amir Anter, Shlomi Dolev

Department of Computer Science

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	891-902
Number of pages	12
Journal	Natural Computing
Volume	9
Issue number	4
DOIs	https://doi.org/10.1007/s11047-009-9168-2
State	Published - 1 Dec 2010

Keywords

Hard in average
Optical computing
Permanent

ASJC Scopus subject areas

Computer Science Applications

Access to Document

10.1007/s11047-009-9168-2

Cite this

@article{c56e8ffca3f743d596148283a544945c,

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

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.",

keywords = "Hard in average, Optical computing, Permanent",

author = "Amir Anter and Shlomi Dolev",

year = "2010",

month = dec,

day = "1",

doi = "10.1007/s11047-009-9168-2",

language = "English",

volume = "9",

pages = "891--902",

journal = "Natural Computing",

issn = "1567-7818",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

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

AU - Anter, Amir

AU - Dolev, Shlomi

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

KW - Hard in average

KW - Optical computing

KW - Permanent

UR - http://www.scopus.com/inward/record.url?scp=78649907335&partnerID=8YFLogxK

U2 - 10.1007/s11047-009-9168-2

DO - 10.1007/s11047-009-9168-2

M3 - Article

AN - SCOPUS:78649907335

SN - 1567-7818

VL - 9

SP - 891

EP - 902

JO - Natural Computing

JF - Natural Computing

IS - 4

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this