An extension of the dual complexity space and an application to computer science
DOI10.1016/J.TOPOL.2009.02.009zbMATH Open1198.68153OpenAlexW2155368129MaRDI QIDQ1032953FDOQ1032953
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
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
interval analysisextended quasi-metricdual complexity spaceordered normed monoidright \(K\)-sequentially complete
Analysis of algorithms and problem complexity (68Q25) Complete metric spaces (54E50) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05)
Cites Work
- Title not available (Why is that?)
- PCF extended with real numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- C-complete quasi-uniform spaces
- Domain-theoretic solution of differential equations (scalar fields)
- Quasi-metric properties of complexity spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Duality and quasi-normability for complexity spaces
- A quasi-metric topology compatible with inclusion monotonicity on interval space
- Title not available (Why is that?)
- Extendible spaces
- Domain theory and differential calculus (functions of one variable)
- Foundations of Software Science and Computational Structures
- Spaces of continuous functions and quasi-uniform convergence
- Induction and recursion on the partial real line with applications to Real PCF
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, Languages and Programming
Cited In (12)
- Some properties of bornological convergences
- 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
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
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)