Complexity of Operators on Compact Sets
Xishun Zhao, Norbert Müller · Electronic Notes in Theoretical Computer Science · 2008
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.