Colored Hypergraph Isomorphism is Fixed Parameter Tractable

We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism , denoted CHI, which has running time (2 b N ) O (1) , where the parameter b is the maximum size of the color classes of the given hypergraphs and N is the input size. We also describe an fpt algorithm for a parameterized coset intersection problem that is used as a subroutine in our algorithm for CHI.