Linear and Sublinear Time Algorithms for Basis of Abelian Groups

15 years 10 months ago

Download www.cs.panam.edu

It is well known that every ﬁnite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of order pj for some prime p and

Li Chen, Bin Fu

Real-time Traffic

Algorithms | Cyclic Group | ISAAC 2009 | ﬁnite Abelian Group |

claim paper

» An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem

» Fast algorithms for differential equations in positive characteristic

» Linear Time Membership for a Class of XML Types with Interleaving and Counting

» Linear time membership in a class of regular expressions with interleaving and counting

» Algorithms for Large Integer Matrix Problems

» Linear manifold clustering in high dimensional spaces by stochastic search

» Estimate haplotype frequencies in pedigrees

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Li Chen, Bin Fu

Comments (0)

Sciweavers

Linear and Sublinear Time Algorithms for Basis of Abelian Groups

Algorithms | Cyclic Group | ISAAC 2009 | ﬁnite Abelian Group |

Explore & Download

Productivity Tools

Sciweavers