12 search results - page 1 / 3 » Algorithms for a class of infinite permutation groups |
JSC
2008
13 years 5 months ago
2008
Motivated by the famous 3n + 1 conjecture, we call a mapping from Z to Z residue-class-wise affine if there is a positive integer m such that it is affine on residue classes (mod m...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
FOCS
2002
IEEE
13 years 10 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...
CSR
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
FSTTCS
2010
Springer
13 years 3 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...