The Parametrized Complexity of Some Fundamental Problems in Coding Theory
From MaRDI portal
Recommendations
Cited in
(44)- Hardness of approximating the minimum distance of a linear code
- Parameterized complexity of even/odd subgraph problems
- On the subgroup distance problem.
- Parameterized complexity of generalized domination problems
- The birth and early years of parameterized complexity
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- An exact algorithm for connected red-blue dominating set
- On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
- Algorithms for computing parameters of graph-based extensions of BCH codes
- Sort and Search: exact algorithms for generalized domination
- Parameterized Intractability of Even Set and Shortest Vector Problem
- Binary constraint satisfaction problems defined by excluded topological minors
- And/or-convexity: a graph convexity based on processes and deadlock models
- On the complexity of decision problems for counter machines with applications to coding theory
- A formula for multiple classifiers in data mining based on Brandt semigroups
- Solving linear equations parameterized by Hamming weight
- Conjunctive-query containment and constraint satisfaction
- On Multidimensional and Monotone k-SUM
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Minimum light number of lit-only \(\sigma\)-game on a tree
- Confronting intractability via parameters
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms
- Detecting monomials with \(k\) distinct variables
- Surfing with Rod
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\)
- Covering Vectors by Spaces: Regular Matroids
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders
- Parameterized intractability of even set and shortest vector problem from Gap-ETH
- Parameterized complexity of small weight automorphisms and isomorphisms
- Blum Static Complexity and Encoding Spaces
- Some Applications of Coding Theory in Computational Complexity
- Editing to Eulerian graphs
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_p\) norms
- On the complexity of finding large odd induced subgraphs and odd colorings
- On the computational complexity of length- and neighborhood-constrained path problems
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- scientific article; zbMATH DE number 7561552 (Why is no real title available?)
- Improved kernel results for some FPT problems based on simple observations
- scientific article; zbMATH DE number 4218008 (Why is no real title available?)
- scientific article; zbMATH DE number 2065311 (Why is no real title available?)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
- The general \(\sigma \) all-ones problem for trees
This page was built for publication: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943754)
