The following pages link to On Problems as Hard as CNF-SAT (Q4962605):
Displaying 49 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- On exact algorithms for the permutation CSP (Q392031) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (Q3448788) (← links)
- On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- (Q4638059) (← links)
- (Q5002765) (← links)
- On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- (Q5089217) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- (Q5090495) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- On the Complexity of Bounded Context Switching. (Q5111714) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Fine-grained complexity of safety verification (Q5919003) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5970782) (← links)
- (Q6089666) (← links)
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)
