Pages that link to "Item:Q856413"
From MaRDI portal
The following pages link to Strong computational lower bounds via parameterized complexity (Q856413):
Displaying 43 items.
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- A second step toward the strong polynomial-time hierarchy (Q3816982) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Logical complexity of induced subgraph isomorphism for certain families of graphs (Q5003303) (← links)
- (Q5009486) (← 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)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- (Q5092385) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- (Q5111296) (← links)
- On the Complexity of Bounded Context Switching. (Q5111714) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Calculation of Discrepancy Measures and Applications (Q5264200) (← links)
- On the Pseudo-achromatic Number Problem (Q5302045) (← links)
- Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- Obtaining a proportional allocation by deleting items (Q5925523) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly (Q6086996) (← links)
- Iterated lower bound formulas: a diagonalization-based approach to proof complexity (Q6086997) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- Counting Small Induced Subgraphs with Hereditary Properties (Q6154192) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths (Q6171262) (← links)
- Pattern masking for dictionary matching: theory and practice (Q6547212) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
- Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)