Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science（2007）
摘要
The complexity of the Black-White Pebbling Game has remained open for 30 years. It was devised to capture the power of non-deterministic space bounded computation. Since then it has been applied to problems in diverse areas of computer science including VLSI design and more recently propositional proof complexity. In this paper we show that the Black-White Pebbling Game is PSPACE-complete. We then use similar ideas in a more complicated reduction to prove the PSPACEcompleteness of Resolution space. The reduction also yields a surprising exponential time/space speedup for Resolution in which an increase of 3 units of space results in an exponential decrease in proof-size.
更多查看译文
关键词
resolution space,exponential decrease,space speedups,surprising exponential time,space result,complicated reduction,propositional proof complexity,space speedup,vlsi design,non-deterministic space,exponential time,black-white pebbling game,computational complexity,game theory,computer science
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要