158 search results - page 3 / 32 » Some counting problems related to permutation groups |
ASIACRYPT
2007
Springer
14 years 14 days ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
DCC
2006
IEEE
14 years 5 months ago
2006
IEEE
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
ISSAC
2007
Springer
14 years 13 days ago
2007
Springer
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...
GECCO
2007
Springer
14 years 13 days ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...