Two-closures of supersolvable permutation groups in polynomial time Full article
| Journal |
Computational Complexity
ISSN: 1016-3328 , E-ISSN: 1420-8954 |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2020, Volume: 29, Number: 1, Article number : 5, Pages count : 33 DOI: 10.1007/s00037-020-00195-7 | ||||||
| Tags | 2-closure; 20B25; 20B40; Permutation group; Polynomial-time algorithm | ||||||
| Authors |
|
||||||
| Affiliations |
|
Cite:
Ponomarenko I.
, Vasil’ev A.
Two-closures of supersolvable permutation groups in polynomial time
Computational Complexity. 2020. V.29. N1. 5 :1-33. DOI: 10.1007/s00037-020-00195-7 WOS Scopus OpenAlex
Two-closures of supersolvable permutation groups in polynomial time
Computational Complexity. 2020. V.29. N1. 5 :1-33. DOI: 10.1007/s00037-020-00195-7 WOS Scopus OpenAlex
Dates:
| Published online: | Jun 24, 2020 |
Identifiers:
| Web of science: | WOS:000542226500001 |
| Scopus: | 2-s2.0-85086791257 |
| OpenAlex: | W3037286085 |