| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422160 | Electronic Notes in Theoretical Computer Science | 2008 | 19 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
