An extension of the dual complexity space and an application to computer science

DOI10.1016/J.TOPOL.2009.02.009MaRDI QIDQ1032953zbMATH OpenOpenAlexFDO

Authors Jesús Rodríguez-López, M. Schellekens, O. Valero

Publication date 5 November 2009

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

Full work available at URL https://doi.org/10.1016/j.topol.2009.02.009

zbMATH Keywords

interval analysisextended quasi-metricdual complexity spaceordered normed monoidright \(K\)-sequentially complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complete metric spaces (54E50) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05)

Recommendations

• On the structure of the space of complexity partial functions
• An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
• The complexity space of partial functions: a connection between complexity analysis and denotational semantics
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• The dual complexity space as the dual of a normed cone

Cites work

• scientific article; zbMATH DE number 1670818 (Why is no real title available?)
• scientific article; zbMATH DE number 987572 (Why is no real title available?)
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3751583 (Why is no real title available?)
• scientific article; zbMATH DE number 1101628 (Why is no real title available?)
• scientific article; zbMATH DE number 1945305 (Why is no real title available?)
• scientific article; zbMATH DE number 1992718 (Why is no real title available?)
• scientific article; zbMATH DE number 3440003 (Why is no real title available?)
• scientific article; zbMATH DE number 6026956 (Why is no real title available?)
• A quasi-metric topology compatible with inclusion monotonicity on interval space
• Automata, Languages and Programming
• C-complete quasi-uniform spaces
• Domain theory and differential calculus (functions of one variable)
• Domain-theoretic solution of differential equations (scalar fields)
• Duality and quasi-normability for complexity spaces
• Extendible spaces
• Foundations of Software Science and Computational Structures
• Induction and recursion on the partial real line with applications to Real PCF
• PCF extended with real numbers
• Quasi-metric properties of complexity spaces
• Spaces of continuous functions and quasi-uniform convergence

Cited in

(12)

• Some properties of bornological convergences
• 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
• More about complements of quasi-uniformities
• The Isbell-hull of a di-space
• Problems, models and complexity. II: Application to the DLSP
• New perspectives of granular computing in relation geometry induced by pairings
• A characterization of Smyth complete quasi-metric spaces via Caristi's fixed point theorem
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• The uniform boundedness theorem in asymmetric normed spaces
• Characterizations of metrizable topological vector spaces and their asymmetric generalizations in terms of fuzzy (quasi-)norms
• An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words

This page was built for publication: An extension of the dual complexity space and an application to computer science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1032953)