Two-closures of supersolvable permutation groups in polynomial time › Research Explorer

Novosibirsk State University's Research Portal

Two-closures of supersolvable permutation groups in polynomial time

Research output: Contribution to journal › Article › peer-review

Section of Algebra and Mathematical Logic

DOI

https://doi.org/10.1007/s00037-020-00195-7
Final published version

Ilia Ponomarenko
Andrey Vasil’ev

Original language	English
Article number	5
Number of pages	33
Journal	Computational Complexity
Volume	29
Issue number	1
DOIs	https://doi.org/10.1007/s00037-020-00195-7
Publication status	Published - 1 Jun 2020

Research areas

2-closure, 20B25, 20B40, Permutation group, Polynomial-time algorithm

OECD FOS+WOS

ID: 24568285