Sciweavers

174 search results - page 18 / 35
» Permutation Groups in NC
Sort
View
JCT
2010
112views more  JCT 2010»
13 years 6 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 1 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
FOCS
1992
IEEE
13 years 11 months ago
Computing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
Eugene M. Luks
COMBINATORICS
2000
103views more  COMBINATORICS 2000»
13 years 7 months ago
The Action of the Symmetric Group on a Generalized Partition Semilattice
Given an integer n 2, and a non-negative integer k, consider all affine hyperplanes in Rn of the form xi = xj +r for i, j [n] and a non-negative integer r k. Let n,k be the pos...
Robert Gill
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 8 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee