Complexity of operators on compact sets
From MaRDI portal
Recommendations
Cites work
- Computability on Regular Subsets of Euclidean Space
- Computable operators on regular sets
- Computational complexity of real functions
- Computational Complexity of Two-Dimensional Regions
- Computational complexity on computable metric spaces
- Fast Multiple-Precision Evaluation of Elementary Functions
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- On some natural complete operators
- On the complexity of finding paths in a two-dimensional domain I: Shortest paths
- The computational complexity of maximization and integration
- The computational complexity of some Julia sets
Cited in
(10)- The complexity of some ordinal determined classes of operators
- Complexity theory for operators in analysis
- scientific article; zbMATH DE number 6672540 (Why is no real title available?)
- scientific article; zbMATH DE number 5901113 (Why is no real title available?)
- Positive set‐operators of low complexity
- scientific article; zbMATH DE number 769607 (Why is no real title available?)
- Jordan Areas and Grids
- Parametrized uniform complexity of computation in geometry and numerics
- On the query complexity of real functionals
- Operations on approximatively compact sets
This page was built for publication: Complexity of operators on compact sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918033)