Pages that link to "Item:Q4943754"

The following pages link to The Parametrized Complexity of Some Fundamental Problems in Coding Theory (Q4943754):

Displaying 40 items.

• Solving linear equations parameterized by Hamming weight (Q309792) (← links)
• Parameterized complexity of generalized domination problems (Q415279) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Detecting monomials with \(k\) distinct variables (Q477587) (← links)
• On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
• Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
• Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
• An exact algorithm for connected red-blue dominating set (Q635737) (← links)
• Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
• Editing to Eulerian graphs (Q896016) (← links)
• The general \(\sigma \) all-ones problem for trees (Q944730) (← links)
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
• Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
• Minimum light number of lit-only \(\sigma\)-game on a tree (Q995589) (← links)
• On the subgroup distance problem. (Q1011736) (← links)
• A formula for multiple classifiers in data mining based on Brandt semigroups (Q1014262) (← links)
• Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
• Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
• And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
• The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
• Parameterized complexity of small weight automorphisms and isomorphisms (Q2067668) (← links)
• On the complexity of decision problems for counter machines with applications to coding theory (Q2163996) (← links)
• The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
• On the computational complexity of length- and neighborhood-constrained path problems (Q2294439) (← links)
• Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
• Algorithms for computing parameters of graph-based extensions of BCH codes (Q2466021) (← links)
• FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
• Blum Static Complexity and Encoding Spaces (Q2843080) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• Surfing with Rod (Q2973715) (← links)
• (Q3364203) (← links)
• On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids (Q3449854) (← links)
• Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
• Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
• (Q5091216) (← links)
• On Multidimensional and Monotone k-SUM (Q5111265) (← links)
• Some Applications of Coding Theory in Computational Complexity (Q5465364) (← links)
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479385) (← links)
• On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
• Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)