Succinct representation of finite abelian groups

DOI10.1145/1145768.1145788MaRDI QIDQ2958975zbMATH OpenOpenAlexFDO

Authors Arash Farzan, J. Ian Munro

Publication date 3 February 2017

Published in Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1145768.1145788

zbMATH Keywords

abelian groupfinite groupspace-efficient representationsuccinct data structure

Mathematics Subject Classification ID

Finite abelian groups (20K01) Data structures (68P05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1257081
• Computing the structure of a finite abelian group
• Space efficient representations of finite groups
• Efficient algorithms for the basis of finite abelian groups
• Analysis of algorithms on problems in general abelian groups

Cited in

(6)

• Describing finite groups by short first-order sentences
• Space efficient representations of finite groups
• Compact data structures for Dedekind groups and finite rings
• Succinct representations of finite groups
• Linear space data structures for finite groups with constant query-time
• On the complexity of problems on graphs defined on groups

This page was built for publication: Succinct representation of finite abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958975)