The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups

DOI10.1007/978-3-319-03898-8_2zbMath1407.68200arXiv1301.0379OpenAlexW54441500MaRDI QIDQ2867068

V. Arvind

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.0379

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subgroups of symmetric groups (20B35)

Related Items (1)

Derangements in wreath products of permutation groups

This page was built for publication: The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups