On computational complexity of membership test in flow games and linear production games.


https://doi.org/10.1007/s001820200106
@article{DBLP:journals/ijgt/FangZCD02, author = {Qizhi Fang and Shanfeng Zhu and Mao{-}cheng Cai and Xiaotie Deng}, title = {On computational complexity of membership test in flow games and linear production games}, journal = {Int. J. Game Theory}, volume = {31}, number = {1}, pages = {39--45}, year = {2002}, url = {https://doi.org/10.1007/s001820200106}, doi = {10.1007/s001820200106}, timestamp = {Fri, 27 Mar 2020 08:40:19 +0100}, biburl = {https://dblp.org/rec/journals/ijgt/FangZCD02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21