DeepAI AI Chat
Log In Sign Up

A New Fast Computation of a Permanent

by   Xuewei Niu, et al.

This paper proposes a general algorithm called Store-zechin for quickly computing the permanent of an arbitrary square matrix. Its key idea is storage, multiplexing, and recursion. That is, in a recursive process, some sub-terms which have already been calculated are no longer calculated, but are directly substituted with the previous calculation results. The new algorithm utilizes sufficiently computer memories and stored data to speed the computation of a permanent. The Analyses show that computating the permanent of an n * n matrix by Store-zechin requires (2^(n - 1)- 1)n multiplications and (2^(n-1))(n - 2)+ 1 additions while does (2^n - 1)n + 1 multiplications and (2^n - n)(n + 1)- 2 additions by the Ryser algorithm, and does (2^(n - 1))n + (n + 2) multiplications and (2^(n - 1))(n + 1)+ (n^2 - n -1) additions by the R-N-W algorithm. Therefore, Store-zechin is excellent more than the latter two algorithms, and has a better application prospect.


page 1

page 2

page 3

page 4


The Multiphoton Boson Sampling Machine Doesn't Beat Early Classical Computers for Five-boson Sampling

An ignored algorithm called Store-reuse for calculating the permanent of...

An Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon

In this paper a new algorithm has been proposed which can fix the proble...

How does the Mind store Information?

How we store information in our mind has been a major intriguing open qu...

LDU factorization

LU-factorization of matrices is one of the fundamental algorithms of lin...

Reinventing Data Stores for Video Analytics

We present a data store managing large videos for retrospective analytic...

Improving Confidentiality for NFT Referenced Data Stores

A non-fungible token (NFT) references a data store location, typically, ...

Graceful Forgetting II. Data as a Process

Data are rapidly growing in size and importance for society, a trend mot...