Complexity spaces as quantitative domains of computation
DOI10.1016/J.TOPOL.2011.01.005zbMATH Open1233.06005OpenAlexW2081459260MaRDI QIDQ536037FDOQ536037
Authors: Salvador Romaguera, M. Schellekens, O. Valero 
Publication date: 16 May 2011
Published in: Topology and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/48240
Recommendations
computational complexityquantitative domaincontinuous domaincomplexity spacepointed complexity spaceScot topology
Analysis of algorithms and problem complexity (68Q25) Metric spaces, metrizability (54E35) Continuous lattices and posets, applications (06B35)
Cites Work
- Approximation of metric spaces by partial metric spaces
- A quantitative computational model for complete partial metric spaces via formal balls
- Partial Metric Topology
- A computational model for metric spaces
- Sequence spaces and asymmetric norms in the theory of computational complexity.
- A characterization of partial metrizability: Domains are quantifiable.
- Quantitative continuous domains
- The constructive maximal point space and partial metrizability
- Title not available (Why is that?)
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- The Smyth Completion
- Continuous Lattices and Domains
- Partial metrisability of continuous posets
- Quasi-metric properties of complexity spaces
- Applications of the complexity space to the general probabilistic divide and conquer algorithms
- Title not available (Why is that?)
- Duality and quasi-normability for complexity spaces
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- On the structure of the space of complexity partial functions
Cited In (14)
- A domain-theoretic approach to fuzzy metric spaces
- Title not available (Why is that?)
- New perspectives of granular computing in relation geometry induced by pairings
- On fixed point theory in partial metric spaces
- Characterization of realizable space complexities
- Fixed point theorems in generalized metric spaces with applications to computer science
- A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application
- Quasi-metric properties of the dual cone of an asymmetric normed space
- On the construction of domains of formal balls for uniform spaces
- Intrinsic approach spaces on domains
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- Fundamentals of Computation Theory
- Fixed points of contractive maps on dcpo's
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
This page was built for publication: Complexity spaces as quantitative domains of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536037)
