Complexity spaces as quantitative domains of computation
From MaRDI portal
(Redirected from Publication:536037)
Recommendations
Cites work
- scientific article; zbMATH DE number 1670818 (Why is no real title available?)
- scientific article; zbMATH DE number 1339873 (Why is no real title available?)
- A characterization of partial metrizability: Domains are quantifiable.
- A computational model for metric spaces
- A quantitative computational model for complete partial metric spaces via formal balls
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- Applications of the complexity space to the general probabilistic divide and conquer algorithms
- Approximation of metric spaces by partial metric spaces
- Continuous Lattices and Domains
- Duality and quasi-normability for complexity spaces
- On the structure of the space of complexity partial functions
- Partial Metric Topology
- Partial metrisability of continuous posets
- Quantitative continuous domains
- Quasi-metric properties of complexity spaces
- Sequence spaces and asymmetric norms in the theory of computational complexity.
- The Smyth Completion
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- The constructive maximal point space and partial metrizability
Cited in
(14)- A domain-theoretic approach to fuzzy metric spaces
- scientific article; zbMATH DE number 1543339 (Why is no real title available?)
- 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)