Parameterized complexity of small weight automorphisms and isomorphisms

DOI10.1007/S00453-021-00867-YOpenAlexW3193710893MaRDI QIDQ2067668

Johannes Köbler, Sebastian Kuhnert, V. Arvind, Jacobo Toran

Publication date: 18 January 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00867-y

zbMATH Keywords

parameterized complexitygraph isomorphismgraph automorphism

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving linear equations parameterized by Hamming weight
• A note on the graph isomorphism counting problem
• Parametrized complexity theory.
• Isomorphism of (mis)Labeled Graphs
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Color-coding
• The intractability of computing the minimum distance of a code
• Parameterized Complexity of Small Weight Automorphisms.
• Hardness of approximating the minimum distance of a linear code
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
• Parameterized Intractability of Even Set and Shortest Vector Problem
• Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable

This page was built for publication: Parameterized complexity of small weight automorphisms and isomorphisms