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

Authors:
Amir Anter;Shlomi Dolev
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel
Venue:
Natural Computing: an international journal
Year:
2010

Citing 5
Cited 2

Optical computing: a survey for computer scientists

Optical computing: a survey for computer scientists
Lower bounds on the computational power of an optical model of computation

Natural Computing: an international journal
Proceedings of the 1st international workshop on Optical SuperComputing

OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach
The traveling beams optical solutions for bounded NP-complete problems

FUN'07 Proceedings of the 4th international conference on Fun with algorithms

Nanotechnology based optical solution for NP-hard problems

OSC'10 Proceedings of the Third international conference on Optical supercomputing
Holographic computation of balanced succinct permanent instances

OSC'10 Proceedings of the Third international conference on Optical supercomputing

Quantified Score

Hi-index	0.00

Visualization

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.