Answers are grounded in this paper and cite their sources.
Let [Formula: see text] be an integer. It is proved that the m-closure of a given solvable permutation group of degree n can be constructed in time [Formula: see text].
No takes yet. Share an insight, caveat, or question.
Ponomarenko et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: