Answers are grounded in this paper and cite their sources.
This analysis finds that NEXP not in coNEXP suggests implications for bounded arithmetic theory, highlighting consistency with a stronger theory.
It was recently shown by Atserias, Buss and Mueller that the standard complexity-theoretic conjecture NEXP not in P / poly is consistent with the relatively strong bounded arithmetic theory V^0_2, which can prove a substantial part of complexity theory. We observe that their approach can be extended to show that the stronger conjectures NEXP not in EXP / poly and NEXP not in coNEXP are consistent with a stronger theory, which includes every true universal number-sort sentence.
No takes yet. Share an insight, caveat, or question.
Neil Thapen (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: