scientific article; zbMATH DE number 1258313
From MaRDI portal
Publication:4229136
Recommendations
Cited in
(12)- THE A-COMPLEXITY OF A SPACE
- Duality and quasi-normability for complexity spaces
- Norm-weightable Riesz spaces and the dual complexity space
- The Null Space Problem I. Complexity
- Characterization of realizable space complexities
- The solution of the algorithm of Divide \& Conquer using weighted complete metric spaces
- Fixed point theorems for fuzzy mappings in quasi-metric spaces
- Sequence spaces and asymmetric norms in the theory of computational complexity.
- Complexity spaces as quantitative domains of computation
- On the Yoneda completion of a quasi-metric space
- Applications of the complexity space to the general probabilistic divide and conquer algorithms
- The quasi-metric of complexity convergence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229136)