We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism} which has running time $b!2^{O(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 fpt algorithms for certain permutation group problems that ... more >>>

Valiant (SIAM Journal on Computing 8, pages 410--421) showed that the roblem of counting the number of s-t paths in graphs (both in the case of directed graphs and in the case of undirected graphs) is complete for #P under polynomial-time one-Turing reductions (namely, some post-computation is needed to recover ... more >>>