
The Multiphoton Boson Sampling Machine Doesn't Beat Early Classical Computers for Fiveboson Sampling
An ignored algorithm called Storereuse for calculating the permanent of...
read it

An Extension Of WeilerAtherton Algorithm To Cope With The Selfintersecting Polygon
In this paper a new algorithm has been proposed which can fix the proble...
read it

How does the Mind store Information?
How we store information in our mind has been a major intriguing open qu...
read it

LDU factorization
LUfactorization of matrices is one of the fundamental algorithms of lin...
read it

Reinventing Data Stores for Video Analytics
We present a data store managing large videos for retrospective analytic...
read it

Benefit of SelfStabilizing Protocols in Eventually Consistent KeyValue Stores: A Case Study
In this paper, we focus on the implementation of distributed programs in...
read it

A New Algorithm based on Extent Bitarray for Computing Formal Concepts
The emergence of Formal Concept Analysis (FCA) as a data analysis techni...
read it
A New Fast Computation of a Permanent
This paper proposes a general algorithm called Storezechin 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 subterms 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 Storezechin requires (2^(n  1) 1)n multiplications and (2^(n1))(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 RNW algorithm. Therefore, Storezechin is excellent more than the latter two algorithms, and has a better application prospect.
READ FULL TEXT
Comments
There are no comments yet.