𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomials for the Jordan decomposition in characteristic p

✍ Scribed by William C. Waterhouse

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
169 KB
Volume
392
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient p-adic Cell Decompositions for
Efficient p-adic Cell Decompositions for Univariate Polynomials
✍ Michael Maller; Jennifer Whitehead πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 177 KB

Cell decompositions are constructed for polynomials f (x) # Z p [x] of degree n, such that n< p, using O(n 2 ) cells. When f is square-free this yields a polynomialtime algorithm for counting and approximating roots in Z p . These results extend to give a polynomial-time algorithm in the bit model f

Parallel algorithm for the computation o
Parallel algorithm for the computation of characteristic polynomials of chemical graphs
✍ P. Venuvanalingam; P. Thangavel πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 413 KB

A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p