An f(k) n^O(1) algorithm for #k-matching is claimed, implying #W[1] = FPT and falsifying ETH, #ETH, and W[1] ≠ FPT.
Exponential time complexity of the permanent and the Tutte polynomial
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.
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.
-
Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.