Pages that link to "Item:Q1892937"

The following pages link to Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937):

Displaying 50 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• On the efficiency of polynomial time approximation schemes (Q290268) (← links)
• Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
• On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
• Treewidth governs the complexity of target set selection (Q456700) (← links)
• Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• The intractability of computing the Hamming distance (Q557834) (← links)
• Parameterized pursuit-evasion games (Q604466) (← links)
• Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
• Advice classes of parametrized tractability (Q676315) (← links)
• A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
• Compactors for parameterized counting problems (Q826317) (← links)
• Parameterized power domination complexity (Q844180) (← links)
• Strong computational lower bounds via parameterized complexity (Q856413) (← links)
• Backdoor sets for DLL subsolvers (Q862400) (← links)
• Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
• W-hierarchies defined by symmetric gates (Q970108) (← links)
• The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
• Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
• Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
• On the complexity of database queries (Q1307689) (← links)
• On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
• Which problems have strongly exponential complexity? (Q1604206) (← links)
• On variants of vertex geography on undirected graphs (Q1627869) (← links)
• On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
• Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
• Preprocessing of intractable problems (Q1854544) (← links)
• Describing parameterized complexity classes (Q1877556) (← links)
• The Turing way to parameterized complexity (Q1877697) (← links)
• On the existence of subexponential parameterized algorithms (Q1877709) (← links)
• \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
• On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
• From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
• The complexity of the asynchronous prediction of the majority automata (Q2201796) (← links)
• Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
• A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
• Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
• Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
• The parameterized complexity of stabbing rectangles (Q2428672) (← links)
• Sparse parameterized problems (Q2564046) (← links)
• Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
• Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
• On structural parameterizations of Node Kayles (Q2695476) (← links)
• Parameterized Complexity of Discrete Morse Theory (Q2828168) (← links)
• Parameterized Complexity (Q2841253) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)