On p-Optimal Proof Systems and Logics for PTIME

被引：0
|
作者：
Chen, Yijia [1 ]
Flum, Joerg [2 ]
机构：
[1] Shanghai Jiao Tong Univ, Dept Comp Sci, Shanghai, Peoples R China
[2] Albert-Ludwigs Universitat Freiburg, Matemat Inst, Freiburg, Germany
来源：
AUTOMATA, LANGUAGES AND PROGRAMMING, PT II | 2010年 / 6199卷
关键词：
COMPLETE-SETS; COMPLEXITY;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show that TAUT has no effective p-optimal proof system if NTIME(h(O(1))) not subset of DIIME(h(O(logh))) for every time constructible and increasing function h.
引用
收藏
页码：321 / +
页数：2
相关论文
共 50 条
12345