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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.