Finding fixed point free elements and small bases in permutation groups

DOI10.1016/j.tcs.2017.05.007zbMath1371.68100OpenAlexW2619845614MaRDI QIDQ2357380

V. Arvind

Publication date: 13 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.007

zbMATH Keywords

permutation groupsfixed-point-free permutationsrandomized computationdeterministic polynomial time

Mathematics Subject Classification ID

Cites Work

• The complexity of the weight problem for permutation and matrix groups.
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• On the number of fixed point free elements in a permutation group
• Parametrized complexity theory.
• Some NP-Complete Problems Similar to Graph Isomorphism
• Minimum bases for permutation groups: The greedy approximation
• On a theorem of Jordan
• Graph isomorphism in quasipolynomial time [extended abstract]
• On a combinatorial game
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding fixed point free elements and small bases in permutation groups