[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

A Permanent Algorithm with exp[Ω (n ^{1/3}/2 ln n )] Expected Speedup for 0-1 Matrices

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

This paper outlines a permanent algorithm with mildly exponential expected speedup over Ryser's inclusion and exclusion algorithm for 0-1 matrices. The algorithm is based on a finite-difference formula that is a generalization of Ryser's formula. The matrix is augmented by a column of entries selected to produce zero-valued terms in the formula. The algorithm achieves speedup by avoiding computation of many zero-valued terms.

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

Access this article

Subscribe and save

Springer+ Basic
£29.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 includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bax, Franklin A Permanent Algorithm with exp[Ω (n ^{1/3}/2 ln n )] Expected Speedup for 0-1 Matrices . Algorithmica 32, 157–162 (2002). https://doi.org/10.1007/s00453-001-0072-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-001-0072-0

Navigation