The Pspace-Completeness Of Black-White Pebbling

SIAM JOURNAL ON COMPUTING（2010）

引用 7|浏览0

暂无评分

摘要

The complexity of the black-white pebbling game has remained an open problem for 30 years. In this paper we show that the black-white pebbling game is PSPACE-complete.

查看译文

关键词

complexity,pebbling,PSPACE-completeness,black pebbling,black-white pebbling

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要