Separating modules of support-degree k equate to O(k)-subgraph counts, those of symmetric circuit size n^Θ(k) equate to Θ(k)-WL, and their multiplicities equate to differing automorphism cycle indices.
[MS01] Ketan D
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Strengthens the conditional running-time lower bound for Global Label Min-Cut under ETH to (np)^{o(log n / log log n)} via a deterministic reduction.
citing papers explorer
-
A Stronger Conditional Running-Time Lower Bound for Global Label Min-Cut
Strengthens the conditional running-time lower bound for Global Label Min-Cut under ETH to (np)^{o(log n / log log n)} via a deterministic reduction.