当前位置:
X-MOL 学术
›
Theor. Comput. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Further oracles separating conjectures about incompleteness in the finite domain
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-09-22 , DOI: 10.1016/j.tcs.2020.09.040 Titus Dose
中文翻译:
关于有限域中不完全性的猜想的进一步预言
更新日期:2020-11-04
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-09-22 , DOI: 10.1016/j.tcs.2020.09.040 Titus Dose
Pudlák [14] lists several major complexity theoretic conjectures relevant to proof complexity and asks for oracles that separate pairs of corresponding relativized conjectures. Among these conjectures are:
- •
and : coNP (resp., NP) does not contain many-one complete sets that have P-optimal proof systems.
- •
: does not have many-one complete problems.
- •
.
- •
Relative to the first oracle, holds and does not hold.
- •
Relative the second oracle, holds and both and do not hold. This separates from another conjecture by Pudlák, namely the conjecture .
中文翻译:
关于有限域中不完全性的猜想的进一步预言
Pudlák[14]列出了与证明复杂性相关的几个主要的复杂性理论猜想,并要求预言家将成对的相应相对论猜想分开。这些猜想包括:
- •
和 :coNP(resp。,NP)不包含具有P最优证明系统的多套完整集。
- •
: 没有很多完整的问题。
- •
。
- •
相对于第一个神谕, 持有并 不成立。
- •
相对于第二个神谕, 两者兼而有之 和 不举行。这分开 来自普德拉克的另一个猜想,即猜想 。