Quasi-metric properties of complexity spaces

From MaRDI portal
Publication:1807591

DOI10.1016/S0166-8641(98)00102-3zbMath0941.54028MaRDI QIDQ1807591

Michel Schellekens, Salvador Romaguera

Publication date: 3 August 2000

Published in: Topology and its Applications (Search for Journal in Brave)




Related Items (62)

Compactness and finite dimension in asymmetric normed linear spacesPartial metric monoids and semivaluation spacesA characterization of Smyth complete quasi-metric spaces via Caristi's fixed point theoremThe Goldstine theorem for asymmetric normed linear spacesTakahashi's minimization theorem and some related results in quasi-metric spacesA characterisation of weightable quasi-metric generating functionsDominated extensions of functionals and V-convex functions of cancellative conesA characterization of generalized monotone normed conesA new approach on generalized quasimetric spaces induced by partial metric spacesMaps that preserve left (right) $K$-Cauchy sequencesA fixed point theorem for preordered complete fuzzy quasi-metric spaces and an applicationOn Matthews' relationship between quasi-metrics and partial metrics: an aggregation perspectiveHyperspaces of a weightable quasi-metric space: application to models in the theory of computationOn Bourbaki-bounded sets on quasi-pseudometric spacesConjugate families of mappings in pointwise metric fuzzy latticesWeakly weighted generalised quasi-metric spaces and semilatticesCharacterizations of quasi-metric and \(G\)-metric completeness involving \(w\)-distances and fixed pointsThe complexity probabilistic quasi-metric spaceApplications of utility functions defined on quasi-metric spacesSequence spaces and asymmetric norms in the theory of computational complexity.Properties of the distance function to strongly and weakly convex sets in a nonsymmetrical spaceOn aggregation of normed structuresOn quasi-metric aggregation functions and fixed point theoremsA characterization of partial metrizability: Domains are quantifiable.Asymmetric norms and optimal distance points in linear spacesClosed graph and open mapping theorems for normed conesNew results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spacesThe complexity space of partial functions: a connection between complexity analysis and denotational semanticsApplications of the complexity space to the general probabilistic divide and conquer algorithmsRelation between metric spaces and Finsler spacesCompactness in asymmetric normed spacesUnnamed ItemUnnamed ItemFixed point theorems in generalized metric spaces with applications to computer scienceThe Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer scienceComplexity spaces as quantitative domains of computationCompleteness in quasi-metric spaces and Ekeland variational principleWeightable quasi-metric semigroups and semilatticesFixed points of contractive maps on dcpo'sComplexity analysis via approach spacesNew results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programsAggregation of asymmetric distances in computer scienceA Nemytskii-Edelstein type fixed point theorem for partial metric spacesCharacterizations of metrizable topological vector spaces and their asymmetric generalizations in terms of fuzzy (quasi-)normsQuasi-metrics and monotone normalityQuotient normed conesThe average running time of an algorithm as a midpoint between fuzzy setsAn Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of WordsOn the structure of the space of complexity partial functionsA formula for the superdifferential of the distance determined by the gauge function to the complement of a convex setCompact and precompact sets in asymmetric locally convex spacesA quantitative computational model for complete partial metric spaces via formal ballsUnnamed ItemCompact convex sets in 2-dimensional asymmetric normed latticesAn extension of the dual complexity space and an application to computer scienceThe correspondence between partial metrics and semivaluationsOn 0-complete partial metric spaces and quantitative fixed point techniques in denotational semanticsQualitative versus quantitative fixed point techniques in computer science\(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysisBicompleting weightable quasi-metric spaces and partial metric spacesFixed point theorems for fuzzy mappings in quasi-metric spacesVarious generalizations of metric spaces and fixed point theorems




This page was built for publication: Quasi-metric properties of complexity spaces