Pages that link to "Item:Q856413"
From MaRDI portal
The following pages link to Strong computational lower bounds via parameterized complexity (Q856413):
Displaying 50 items.
- On the complexity of connection games (Q307770) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- On first-order definitions of subgraph isomorphism properties (Q679970) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
- Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323) (← links)
- Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- Strong time bounds: Non-computable bounds and a hierarchy theorem (Q909465) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- On the pseudo-achromatic number problem (Q1006054) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- A multistage view on 2-satisfiability (Q2692727) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- On the independent set problem in random graphs (Q2804023) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
- A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
- On the Variable Hierarchy of First-Order Spectra (Q2957699) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- (Q3121527) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- A second step toward the strong polynomial-time hierarchy (Q3816982) (← links)
