This paper proves oracle, logical, and Ladner-type structural theorems for the complexity class ∃R, some conditional on ∃R being different from NP.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
Some structural complexity results for $\exists\mathbb R$
This paper proves oracle, logical, and Ladner-type structural theorems for the complexity class ∃R, some conditional on ∃R being different from NP.