none3We describe an algorithm whic, given a permutation group G of degree n, produces a set of at most n/2 generators for G.DOI: 10.1081/AGB-120029899 ISI WOS: 000221048700005noneA. Lucchini; F. Menegazzo; M. MorigiA. Lucchini; F. Menegazzo; M. Morig
AbstractFor a permutation group given by a set of generators, the problem of finding “special” group...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
This paper presents a new algorithm for determining the order of a solvable permutationgroup from a ...
none3We describe an algorithm whic, given a permutation group G of degree n, produces a set of at mo...
none3We describe an algorithm whic, given a permutation group G of degree n, produces a set of at mo...
In this paper an algorithm is produced, which, given a permutation group G of degree n>3, outputs a ...
In this paper an algorithm is produced, which, given a permutation group G of degree n>3, outputs a ...
Theory of permutation group algorithms for graduates and above. Exercises and hints for implementati...
It is well known that a permutation group of degree n>3 can be generated by [n/2] elements. In this...
AbstractThe computational complexity of the following problem is investigated: Given a permutation g...
International audienceOriginally motivated by algebraic invariant theory, we present an algorithm to...
It is well known that a permutation group of degree $n \neq 3$ can be generated by $[\frac{n}{2}]$ e...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
AbstractThe factorization problem in permutation groups is to represent an elementgof some permutati...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
AbstractFor a permutation group given by a set of generators, the problem of finding “special” group...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
This paper presents a new algorithm for determining the order of a solvable permutationgroup from a ...
none3We describe an algorithm whic, given a permutation group G of degree n, produces a set of at mo...
none3We describe an algorithm whic, given a permutation group G of degree n, produces a set of at mo...
In this paper an algorithm is produced, which, given a permutation group G of degree n>3, outputs a ...
In this paper an algorithm is produced, which, given a permutation group G of degree n>3, outputs a ...
Theory of permutation group algorithms for graduates and above. Exercises and hints for implementati...
It is well known that a permutation group of degree n>3 can be generated by [n/2] elements. In this...
AbstractThe computational complexity of the following problem is investigated: Given a permutation g...
International audienceOriginally motivated by algebraic invariant theory, we present an algorithm to...
It is well known that a permutation group of degree $n \neq 3$ can be generated by $[\frac{n}{2}]$ e...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
AbstractThe factorization problem in permutation groups is to represent an elementgof some permutati...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
AbstractFor a permutation group given by a set of generators, the problem of finding “special” group...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
This paper presents a new algorithm for determining the order of a solvable permutationgroup from a ...
DOI
Add to ORKG