Introduces the Σ^p_2 search problem DD_P and proves that hardness hypothesis (ST) for strong proof systems implies NP ≠ coNP under a model-theoretic assumption on extensions of bounded arithmetic models.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On $NP \cap coNP$ proof complexity generators
Introduces the Σ^p_2 search problem DD_P and proves that hardness hypothesis (ST) for strong proof systems implies NP ≠ coNP under a model-theoretic assumption on extensions of bounded arithmetic models.