The Gallai vertex problem is Θ₂^p-complete.
Proceedings of the nineteenth annual ACM symposium on Theory of computing , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Gallai Vertex Problem is $\Theta_2^p$-Complete
The Gallai vertex problem is Θ₂^p-complete.