Skip to main content

An approximation algorithm for computing the permanent

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 829)

Abstract

Recent results by Valiant indicate that computing the permanent of an n×n matrix probably requires a computation time exponential in n. The problem is at least as difficult as the NP-complete problems. This paper presents a fast algorithm to compute an approximate value of the permanent. Given two arbitrary parameters 0<r<1 and 0<ε<1, the algorithm ensures that, with probability r, its answer will be within a factor of ε of the true value of the permanent. Furthermore, the running time of the algorithm degrades by no worse than a polynomial as ε is decreased or r is increased.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Mass., 1974).

    MATH  Google Scholar 

  2. S.A. Cook, The complexity of theorem proving procedures, Proc. 3rd Annual ACM Symposium on Theory of Computing (A.C.M., New York, 1971), 151–158

    Google Scholar 

  3. M.R. Garey and D.S. Johnson, Computers and Intractability — a Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, 1979).

    MATH  Google Scholar 

  4. J.M. Hammersley and D.C. Handscomb, Monte Carlo Methods (Methuen, London, 1964).

    CrossRef  MATH  Google Scholar 

  5. W. Mendenhall and R.L. Scheaffer, Mathematical Statistics with Applications (Wadsworth, Belmont, 1973).

    Google Scholar 

  6. F. Mosteller, R.E.K. Rourke and G.B. Thomas Jr., Probability with Statistical Applications (Addison-Wesley, Reading, Mass., 1961).

    MATH  Google Scholar 

  7. R. Solovay and V. Strassen, A fast Monte Carlo test for primality, SIAM J. Comput. 6 (1977), 84–85.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. L.G. Valiant, The Complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979), 189–201.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979), 410–421.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Goldschlager, L.M. (1980). An approximation algorithm for computing the permanent. In: Robinson, R.W., Southern, G.W., Wallis, W.D. (eds) Combinatorial Mathematics VII. Lecture Notes in Mathematics, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0088907

Download citation

  • DOI: https://doi.org/10.1007/BFb0088907

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10254-0

  • Online ISBN: 978-3-540-38376-5

  • eBook Packages: Springer Book Archive