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

DOI10.1007/S11047-009-9168-2zbMath1207.68154OpenAlexW2035626053MaRDI QIDQ609025

Shlomi Dolev, Amir Anter

Publication date: 30 November 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-009-9168-2

zbMATH Keywords

permanentoptical computinghard in average

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer system organization (68M99) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

This page was built for publication: Optical solution for hard on average \#P-complete instances (using exponential space for solving instances of the permanent)