Quasi-metric properties of complexity spaces
From MaRDI portal
(Redirected from Publication:1807591)
Recommendations
Cited in
(71)- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- On the structure of the space of complexity partial functions
- The complexity probabilistic quasi-metric space
- Compact convex sets in 2-dimensional asymmetric normed lattices
- Cauchy filters and strong completeness of quasi-uniform spaces
- On complexity of metric spaces
- The Goldstine theorem for asymmetric normed linear spaces
- Compact and precompact sets in asymmetric locally convex spaces
- Asymmetric norms and optimal distance points in linear spaces
- The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
- Relation between metric spaces and Finsler spaces
- Compactness and finite dimension in asymmetric normed linear spaces
- Complexity analysis via approach spaces
- Weightable quasi-metric semigroups and semilattices
- On some properties of the space \(2^{*\omega}\) of binary-digit sequences
- Cocompactness and quasi-uniformizability of completely metrizable spaces.
- The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances
- Maps that preserve left (right) \(K\)-Cauchy sequences
- A characterization of Smyth complete quasi-metric spaces via Caristi's fixed point theorem
- scientific article; zbMATH DE number 6026956 (Why is no real title available?)
- A Nemytskii-Edelstein type fixed point theorem for partial metric spaces
- Properties of the convolution operation in the complexity space and its dual
- Quasi-metrics and monotone normality
- Amorphic complexity can take any nonnegative value in general metric spaces
- Sequence spaces and asymmetric norms in the theory of computational complexity.
- A characterization of partial metrizability: Domains are quantifiable.
- Completeness in quasi-metric spaces and Ekeland variational principle
- Weakly weighted generalised quasi-metric spaces and semilattices
- The correspondence between partial metrics and semivaluations
- The average running time of an algorithm as a midpoint between fuzzy sets
- Partial metric monoids and semivaluation spaces
- The quasi-metric of complexity convergence
- Applications of the complexity space to the general probabilistic divide and conquer algorithms
- An extension of the dual complexity space and an application to computer science
- New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs
- Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation
- A characterization of generalized monotone normed cones
- Applications of utility functions defined on quasi-metric spaces
- Fixed point theorems in generalized metric spaces with applications to computer science
- On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application
- Compactness in asymmetric normed spaces
- Bicompleting weightable quasi-metric spaces and partial metric spaces
- Various generalizations of metric spaces and fixed point theorems
- Conjugate families of mappings in pointwise metric fuzzy lattices
- Characterizations of metrizable topological vector spaces and their asymmetric generalizations in terms of fuzzy (quasi-)norms
- Duality and quasi-normability for complexity spaces
- On Matthews' relationship between quasi-metrics and partial metrics: an aggregation perspective
- Qualitative versus quantitative fixed point techniques in computer science
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- Dominated extensions of functionals and V-convex functions of cancellative cones
- Aggregation of asymmetric distances in computer science
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- On Bourbaki-bounded sets on quasi-pseudometric spaces
- On aggregation of normed structures
- Characterizations of quasi-metric and \(G\)-metric completeness involving \(w\)-distances and fixed points
- On quasi-metric aggregation functions and fixed point theorems
- Fixed point theorems for fuzzy mappings in quasi-metric spaces
- A quantitative computational model for complete partial metric spaces via formal balls
- Fixed points of contractive maps on dcpo's
- A characterisation of weightable quasi-metric generating functions
- A new approach on generalized quasimetric spaces induced by partial metric spaces
- Takahashi's minimization theorem and some related results in quasi-metric spaces
- A formula for the superdifferential of the distance determined by the gauge function to the complement of a convex set
- The complexity space of a valued linearly ordered set
- scientific article; zbMATH DE number 1547051 (Why is no real title available?)
- Closed graph and open mapping theorems for normed cones
- Quotient normed cones
- Properties of the distance function to strongly and weakly convex sets in a nonsymmetrical space
- Complexity spaces as quantitative domains of computation
This page was built for publication: Quasi-metric properties of complexity spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807591)
