An f(k) n^O(1) algorithm for #k-matching is claimed, implying #W[1] = FPT and falsifying ETH, #ETH, and W[1] ≠ FPT.
Corcino and Roberto B
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
$\#$W[1] = $\text{FPT}$: Fixed-Parameter Tractable Exact Algorithms for the $\#k$-Matching Problem
An f(k) n^O(1) algorithm for #k-matching is claimed, implying #W[1] = FPT and falsifying ETH, #ETH, and W[1] ≠ FPT.