𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast computer algorithm for finding the permanent of adjacency matrices

✍ Scribed by Gordon G. Cash

Publisher
Springer
Year
1995
Tongue
English
Weight
321 KB
Volume
18
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

How fast can one compute the permanent o
How fast can one compute the permanent of circulant matrices?
✍ A. Bernasconi; B. Codenotti; V. Crespi; G. Resta πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 665 KB

In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We investigate structural properties of circulant matrices, showing that (i) if they are dense enough, then they contain large arbitrary submatrices, and (ii) if they are very sparse, then they are not too `

A fast algorithm for the inversion of ge
A fast algorithm for the inversion of general Toeplitz matrices
✍ P.G. Martinsson; V. Rokhlin; M. Tygert πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 590 KB

we propose a "fast" algorithm for the construction of a data-sparse inver'~ of a general Toeplitz matrix. The computational cost for inverting an N Γ— N Toeplitz matrix equals the cost of four length-N FFTs plus an O(N)-term. This cost should be compared to the O(Nlog2N) cost of previously published

A fast algorithm for index of annihilati
A fast algorithm for index of annihilation computations
✍ P.Y. Yalamov; M. Mitrouli πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 110 KB

In this paper a fast algorithm for computing the index of annihilation of the associated pencil of a given matrix is presented. Knowledge of this index leads us to the speciΓΏcation of the elementary divisors of the matrix and thus we can specify its canonical forms. It is shown that the new algorith