On the consistency of stronger lower bounds for NEXP
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914170476167168 |
|---|---|
| author | Thapen, Neil |
| author_facet | Thapen, Neil |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_03320 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the consistency of stronger lower bounds for NEXP Thapen, Neil Logic in Computer Science Computational Complexity Logic 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. |
| title | On the consistency of stronger lower bounds for NEXP |
| topic | Logic in Computer Science Computational Complexity Logic |
| url | https://arxiv.org/abs/2504.03320 |