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

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

โœ Scribed by Hiroki Arimura; Takeaki Uno

Publisher
Springer US
Year
2006
Tongue
English
Weight
611 KB
Volume
13
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
โœ S. Rombouts; K. Heyde ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.