CSpace

浏览/检索结果: 共5条,第1-5条 帮助

限定条件    
已选(0)清除 条数/页:   排序方式:
Facility location games with optional preference 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 847, 页码: 185-197
作者:  Chen, Zhihuai;  Fong, Ken C. K.;  Li, Minming;  Wang, Kai;  Yuan, Hongning;  Zhang, Yong
收藏  |  浏览/下载:29/0  |  提交时间:2021/12/01
Game theory  Facility location game  Algorithmic mechanism design  Approximation  
Coreness of cooperative games with truncated submodular profit functions 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 822, 页码: 49-60
作者:  Chen, Wei;  Shan, Xiaohan;  Sun, Xiaoming;  Zhang, Jialin
收藏  |  浏览/下载:41/0  |  提交时间:2020/12/10
Cooperative game  Core  Submodular function  Social network  
On the modulo degree complexity of Boolean functions 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 818, 页码: 32-40
作者:  Li, Qian;  Sun, Xiaoming
收藏  |  浏览/下载:30/0  |  提交时间:2020/12/10
Boolean function  Degree complexity  Polynomial  Decision tree complexity  Hypergraph property  
A tighter relation between sensitivity complexity and certificate complexity 期刊论文
THEORETICAL COMPUTER SCIENCE, 2019, 卷号: 762, 页码: 1-12
作者:  He, Kun;  Li, Qian;  Sun, Xiaoming
收藏  |  浏览/下载:248/0  |  提交时间:2019/04/03
Sensitivity conjecture  Sensitivity  Block sensitivity  Certificate complexity  Boolean functions  
Completeness of Hoare logic with inputs over the standard model 期刊论文
THEORETICAL COMPUTER SCIENCE, 2016, 卷号: 612, 页码: 23-28
作者:  Xu, Zhaowei;  Sui, Yuefei;  Zhang, Wenhui
收藏  |  浏览/下载:41/0  |  提交时间:2019/12/13
Hoare logic  Peano arithmetic  The standard model  Computation  Arithmetical definability  Logical completeness