Sciweavers

174 search results - page 2 / 35
» Permutation Groups in NC
Sort
View
ISSAC
2000
Springer
94views Mathematics» more  ISSAC 2000»
13 years 9 months ago
Computing normalizers of permutation groups efficiently using isomorphisms of association schemes
This note presents an algorithm to speed up the computation of normalizers of permutation groups. It is an application of computation of isomorphisms of association schemes. Categ...
Izumi Miyamoto
DM
2010
82views more  DM 2010»
13 years 6 months ago
The complexity of the weight problem for permutation and matrix groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element G such that d(, e) = k, for some given value k. Here we ...
Peter J. Cameron, Taoyang Wu
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 7 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
APAL
2006
79views more  APAL 2006»
13 years 6 months ago
Cardinal invariants related to permutation groups
We consider the possible cardinalities of the following three cardinal invariants which are related to the permutation group on the set of natural numbers: ag := the least cardina...
Bart Kastermans, Yi Zhang 0008
EC
2002
121views ECommerce» more  EC 2002»
13 years 6 months ago
Group Properties of Crossover and Mutation
It is supposed that the finite search space has certain symmetries which can be described in terms of a group of permutations acting upon it. If crossover and mutation respect th...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright