Complexity of Operators on Compact Sets

DOI10.1016/j.entcs.2008.03.011zbMath1262.03061OpenAlexW1978298068MaRDI QIDQ4918033

Zhao, Xishun, Norbert Th. Müller

Publication date: 3 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.011

zbMATH Keywords

projectionconvex hullcompact setsoracle Turing machinesoperator complexity

Mathematics Subject Classification ID

Compactness (54D30) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Applications of computability and recursion theory (03D80)

Related Items

Jordan Areas and Grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of maximization and integration
• On some natural complete operators
• Computational complexity of real functions
• On the complexity of finding paths in a two-dimensional domain I: Shortest paths
• Computable operators on regular sets
• The computational complexity of some julia sets
• Fast Multiple-Precision Evaluation of Elementary Functions
• Computability on Regular Subsets of Euclidean Space
• Computational complexity on computable metric spaces
• Computational Complexity of Two-Dimensional Regions