Complexity of Operators on Compact Sets

被引：4
|
作者：
Zhao, Xishun [1 ]
Mueller, Norbert [2 ]
机构：
[1] Sun Yat Sen Univ, Inst Log & Cognit, Guangzhou 510275, Guangdong, Peoples R China
[2] Univ Trier, FB 04, Abt Informat, D-54286 Trier, Germany
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2008年 / 202卷
关键词：
Oracle Turing machines; compact sets; operator complexity; projection; convex hull;
D O I：
10.1016/j.entcs.2008.03.011
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Based on oracle Turing machines, we investigate the computational complexity of operators on compact sets. For the projection and convex hull we are able to show exponential upper and lower bounds as well as a connection to the P=NP problem for special settings.
引用
收藏
页码：101 / 119
页数：19
相关论文
共 50 条
12345