English
简体中文
繁體中文
客服热线:400-1616-289
登录
注册
书籍章节
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques
Kord Eickmeyer; Kristoffer Arnstfelt Hansen; Elad Verbin
Algorithmic Game Theory
2012
DOI: 10.1007/978-3-642-33996-7_9
1
阅读
引用
收藏
分享
相关
加载中…
文献加载失败,请重试
重试