# Computational Complexity of Finding Subgroups of a Given Order

Source: [Computational Complexity of Finding Subgroups of a Given Order](<https://www.sota2.com/research/paper/68fa5d181e209131ce9d70ab>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-02-27T05:00:04.201Z

Authors: K. Lakshmanan

Published: 2025-03-14T09:43:58.000Z

## Abstract

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal algorithm for finding a subgroup of a given order when the input is given in the form of a Cayley table. To the best of our knowledge, no prior work has addressed the complexity of this problem under the Cayley table representation.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2503.11238>)

[PDF](<https://arxiv.org/pdf/2503.11238.pdf>)
