Skip to main content
SpringerLink
Log in

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

  • Published:
Natural Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Arora S, Barak B (2007) Computational complexity: a modern approach, on-line draft Jan 2007

  • Dolev S, Fitoussi H (2007) The traveling beams optical solutions for bounded NP-complete problems. In: Proceedings of the 4th international conference fun with algorithms, pp 120–134

  • Fitoussi H (2007) Optical solutions for bounded NP problems. Master thesis, Ben-Gurion University of the Negev

  • Dolev S, Haist T, Oltean M (eds) (2008) Optical super computing, LNCS vol 5172. Springer, Berlin

  • Dolev S, Korach E, Uzan G (2006) A method for encryption and decryption of messages. PCT patent Application WO 2006/001006, Jan 2006

  • Dolev S, Nir Y (2003) Optical implementation of bounded non-deterministic Turing machines. US patent US2005/0013531, field in Israel May 2003

  • Feitelson G (1988) Optical computing: a survey for computer scientists. MIT Press, Cambridge

    Google Scholar 

  • Kittel C (2004) Introduction to solid state physics. Wiley, New York

    Google Scholar 

  • Lipton R (1991) New directions in testing. Distributed computing and cryptography, DIMACS series on discrete mathematics and theoretical computer science 2, American Mathematical Society, pp 191–202

  • Shaked NT, Messika S, Dolev S, Rosen J (2007) Optical solution for bounded NP-complete problems. Appl opt 46(5):711–714

    Google Scholar 

  • Valiant L (1979) The complexity of computing the permanent. Theor Comput Sci 8:189–201

    Article  MATH  MathSciNet  Google Scholar 

  • Woods D, Gibson JP (2005) Lower bounds on the computational power of an optical model of computation. In: Proceedings of the fourth international conference on unconventional computation, LNCS vol 3699, pp 237–250. Journal version, Nat Comput 7(1):95–108

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel

    Amir Anter & Shlomi Dolev

Authors
  1. Amir Anter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shlomi Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shlomi Dolev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anter, A., Dolev, S. Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent). Nat Comput 9, 891–902 (2010). https://doi.org/10.1007/s11047-009-9168-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-009-9168-2

Keywords

Search

Navigation