Pages that link to "Item:Q2568440"

The following pages link to Tight lower bounds for certain parameterized NP-hard problems (Q2568440):

Displaying 36 items.

• Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
• Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
• A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
• Single Parameter FPT-Algorithms for Non-trivial Games (Q3000500) (← links)
• (Q3455999) (← links)
• Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
• On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs (Q3467860) (← links)
• Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
• Simple doubly-efficient interactive proof systems for locally-characterizable sets (Q4993281) (← links)
• Counting problems in parameterized complexity (Q5009461) (← links)
• (Q5009487) (← links)
• On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
• Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
• (Q5092385) (← links)
• (Q5092394) (← links)
• Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
• Tight Hardness Results for Consensus Problems on Circular Strings and Time Series (Q5128513) (← links)
• Calculation of Discrepancy Measures and Applications (Q5264200) (← links)
• Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)
• Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
• Monitoring the edges of a graph using distances (Q5896103) (← links)
• Lower bounds for the happy coloring problems (Q5918935) (← links)
• Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
• (Q6087208) (← links)
• Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) (← links)
• Counting Small Induced Subgraphs with Hereditary Properties (Q6154192) (← links)
• Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
• Strong backdoors for default logic (Q6570091) (← links)
• Parity permutation pattern matching (Q6586663) (← links)
• Strong backdoors for default logic (Q6610193) (← links)
• Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
• Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)