arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.7428cs.GTcs.CC
收藏

布尔博弈的D值是EXP-完全的

DValue for Boolean games is EXP-complete

Egor Ianovski

摘要:

我们证明了以下问题是EXP-完全的:给定一个有理数v和一个两人零和布尔博弈G,确定G的值是否至少为v。

英文摘要:

We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean game G determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean circuit games in Feigenbaum et al. (1995).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑