Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Hypergraph Isomorphism:
TR16-157 | 13th October 2016
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Toran

Parameterized Complexity of Small Weight Automorphisms

We consider the PermCode problem to decide, given a representation of a permutation group G and a parameter k, whether there is a non-trivial element of G with support at most k. This problem generalizes several problems in the literature. We introduce a new method that allows to reduce the ... more >>>

ISSN 1433-8092 | Imprint