Sequence spaces and asymmetric norms in the theory of computational complexity.

From MaRDI portal
Publication:1410069

DOI10.1016/S0895-7177(02)00100-0zbMath1063.68057MaRDI QIDQ1410069

Salvador Romaguera, Enrique Alfonso Sánchez-Pérez, Lluís Miquel Garcia Raffi

Publication date: 14 October 2003

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)




Related Items

Compactness and finite dimension in asymmetric normed linear spaces, Extreme points and geometric aspects of compact convex sets in asymmetric normed spaces, The Goldstine theorem for asymmetric normed linear spaces, Local compactness in right bounded asymmetric normed spaces, A characterisation of weightable quasi-metric generating functions, Dominated extensions of functionals and V-convex functions of cancellative cones, Uniform structures in the beginning of the third millenium, A characterization of generalized monotone normed cones, Quasi-metric properties of the dual cone of an asymmetric normed space, A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application, On Matthews' relationship between quasi-metrics and partial metrics: an aggregation perspective, The uniform boundedness theorem in asymmetric normed spaces, Generalized contractive set-valued maps on complete preordered quasi-metric spaces, The complexity probabilistic quasi-metric space, Convergence and left-\(K\)-sequential completeness in asymmetrically normed lattices, HAHN-BANACH TYPE THEOREMS ON FUNCTIONAL SEPARATION FOR CONVEX ORDERED NORMED CONES, Multilinear operators between asymmetric normed spaces, On aggregation of normed structures, A characterization of completeness via absolutely convergent series and the Weierstrass test in asymmetric normed semilinear spaces, A double completion for an arbitrary \(T_0\)-quasi-metric space, Closed graph and open mapping theorems for normed cones, New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces, The complexity space of partial functions: a connection between complexity analysis and denotational semantics, Applications of the complexity space to the general probabilistic divide and conquer algorithms, On some properties of bitopological QHC spaces, Compactness in asymmetric normed spaces, Unnamed Item, Complexity spaces as quantitative domains of computation, Aggregation of asymmetric distances in computer science, Characterizations of metrizable topological vector spaces and their asymmetric generalizations in terms of fuzzy (quasi-)norms, On balancedness and D-completeness of the space of semi-Lipschitz functions, On the uniform boundedness theorem in fuzzy quasi-normed spaces, On the spaces of linear operators acting between asymmetric cone normed spaces, Quotient normed cones, The average running time of an algorithm as a midpoint between fuzzy sets, On the structure of the space of complexity partial functions, A quantitative computational model for complete partial metric spaces via formal balls, Unnamed Item, Compact convex sets in 2-dimensional asymmetric normed lattices, Continuous operators on asymmetric normed spaces, Convexity of Chebyshev sets contained in a subspace



Cites Work