174 search results - page 14 / 35 » Permutation Groups in NC |
COCO
2004
Springer
14 years 28 days ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
COMBINATORICS
2002
13 years 7 months ago
2002
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
JCT
2008
13 years 7 months ago
2008
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...