๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing sparse permanents faster

โœ Scribed by Rocco A. Servedio; Andrew Wan

Book ID
108153427
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
80 KB
Volume
96
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computing permanents via determinants fo
Computing permanents via determinants for some classes of sparse matrices
โœ Giovanni Resta; Giovanni Sburlati ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 215 KB

Starting from recent formulas for calculating the permanents of some sparse circulant matrices, we obtain more general formulas expressing the permanents of a wider class of matrices as a linear combination of appropriate determinants.

Computing compound distributions faster!
Computing compound distributions faster!
โœ P.W. den Iseger; M.A.J. Smith; R. Dekker ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 650 KB

The use of Panjer's algorithm has meanwhile become a widespread standard technique for actuaries (Kuon et al., 1955). Panjer's recursion formula is used for the evaluation of compound distributions and can be applied to life and general insurance problems. The discrete version of Panjer's recursion

Solving Degenerate Sparse Polynomial Sys
Solving Degenerate Sparse Polynomial Systems Faster
โœ J.Maurice Rojas ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 565 KB

Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in every irreducible component of the zero set Z of F . Our techniques allow us to sharpen and lower prior complexity bounds for this

Computing with sparse matrices
Computing with sparse matrices
โœ T. S. Chow; J. S. Kowalik ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 866 KB