Two-closures of supersolvable permutation groups in polynomial time

Standard

Two-closures of supersolvable permutation groups in polynomial time. / Ponomarenko, Ilia; Vasil’ev, Andrey.

в: Computational Complexity, Том 29, № 1, 5, 01.06.2020.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Ponomarenko, I & Vasil’ev, A 2020, 'Two-closures of supersolvable permutation groups in polynomial time', Computational Complexity, Том. 29, № 1, 5. https://doi.org/10.1007/s00037-020-00195-7

APA

Ponomarenko, I., & Vasil’ev, A. (2020). Two-closures of supersolvable permutation groups in polynomial time. Computational Complexity, 29(1), [5]. https://doi.org/10.1007/s00037-020-00195-7

Vancouver

Ponomarenko I, Vasil’ev A. Two-closures of supersolvable permutation groups in polynomial time. Computational Complexity. 2020 июнь 1;29(1):5. doi: 10.1007/s00037-020-00195-7

Author

Ponomarenko, Ilia ; Vasil’ev, Andrey. / Two-closures of supersolvable permutation groups in polynomial time. в: Computational Complexity. 2020 ; Том 29, № 1.

BibTeX

@article{b9eacee49ba1418c8443097c7d82489d,

title = "Two-closures of supersolvable permutation groups in polynomial time",

abstract = "The 2-closure G¯ of a permutation group G on Ω isdefined to be the largest permutation group on Ω , having thesame orbits on Ω × Ω as G. It is proved that ifG is supersolvable, then G¯ can be found in polynomial timein",

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

author = "Ilia Ponomarenko and Andrey Vasil{\textquoteright}ev",

year = "2020",

month = jun,

day = "1",

doi = "10.1007/s00037-020-00195-7",

language = "English",

volume = "29",

journal = "Computational Complexity",

issn = "1016-3328",

publisher = "Birkhauser Verlag Basel",

number = "1",

}

RIS

TY - JOUR

T1 - Two-closures of supersolvable permutation groups in polynomial time

AU - Ponomarenko, Ilia

AU - Vasil’ev, Andrey

PY - 2020/6/1

Y1 - 2020/6/1

N2 - The 2-closure G¯ of a permutation group G on Ω isdefined to be the largest permutation group on Ω , having thesame orbits on Ω × Ω as G. It is proved that ifG is supersolvable, then G¯ can be found in polynomial timein

AB - The 2-closure G¯ of a permutation group G on Ω isdefined to be the largest permutation group on Ω , having thesame orbits on Ω × Ω as G. It is proved that ifG is supersolvable, then G¯ can be found in polynomial timein

KW - 2-closure

KW - 20B25

KW - 20B40

KW - Permutation group

KW - Polynomial-time algorithm

UR - http://www.scopus.com/inward/record.url?scp=85086791257&partnerID=8YFLogxK

U2 - 10.1007/s00037-020-00195-7

DO - 10.1007/s00037-020-00195-7

M3 - Article

AN - SCOPUS:85086791257

VL - 29

JO - Computational Complexity

JF - Computational Complexity

SN - 1016-3328

IS - 1

M1 - 5

ER -

ID: 24568285