Efficient Algorithms for Abelian group isomorphism and related problems

Telikepalli, Kavitha; Pandya, Paritosh; Radhakrishnan, Jaikumar

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Efficient Algorithms for Abelian group isomorphism and related problems

MPS-Authors

Telikepalli, Kavitha
Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Telikepalli, K. (2003). Efficient Algorithms for Abelian group isomorphism and related problems. In FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science: 23rd Conference (pp. 277-288). Heidelberg, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2CCD-4

Abstract

There is no abstract available