Complexity of Operators on Compact Sets

Authors:
Xishun Zhao;Norbert Müller
Affiliations:
Institute of Logic and Cognition, Sun Yat-Sen University, 510275 Guangzhou, P.R. China;FB IV, Abteilung Informatik, Universität Trier, D-54286 Trier, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 7
Cited 2

Information-based complexity

Information-based complexity
Complexity theory of real functions

Complexity theory of real functions
Computational Complexity of Two-Dimensional Regions

SIAM Journal on Computing
Fast Multiple-Precision Evaluation of Elementary Functions

Journal of the ACM (JACM)
Computable analysis: an introduction

Computable analysis: an introduction
The computational complexity of some julia sets

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the Complexity of Real Functions

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Jordan Areas and Grids

Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity Theory for Operators in Analysis

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.00

Visualization

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.