scientific article; zbMATH DE number 6026956
From MaRDI portal
Publication:5389726
Recommendations
- Algorithmic relative complexity
- scientific article; zbMATH DE number 3251431
- scientific article; zbMATH DE number 2027966
- scientific article; zbMATH DE number 1864855
- Complexity of computer algorithms
- scientific article; zbMATH DE number 4141415
- Algorithmic complexity
- On algorithm complexity
- Computational complexity of the interleaving distance
- The complexity of computing the Muirhead-Dalton distance
Cites work
- Cauchy sequences in quasi-pseudo-metric spaces
- Compactifications of totally bounded quasi-uniform spaces
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- Duality and quasi-normability for complexity spaces
- scientific article; zbMATH DE number 987572 (Why is no real title available?)
- scientific article; zbMATH DE number 4046681 (Why is no real title available?)
- scientific article; zbMATH DE number 4052285 (Why is no real title available?)
- scientific article; zbMATH DE number 42114 (Why is no real title available?)
- scientific article; zbMATH DE number 85793 (Why is no real title available?)
- scientific article; zbMATH DE number 169563 (Why is no real title available?)
- scientific article; zbMATH DE number 572114 (Why is no real title available?)
- scientific article; zbMATH DE number 1784847 (Why is no real title available?)
- Lengths on semigroups and groups
- On completeness in quasi-metric spaces
- On the representation of real numbers using regular languages
- Ordered cones and approximation
- Partial Metric Topology
- Quasi-metric properties of complexity spaces
- Semi-Lipschitz functions and best approximation in quasi-metric spaces
- Sequence spaces and asymmetric norms in the theory of computational complexity.
Cited in
(14)- An extension of the dual complexity space and an application to computer science
- On Matthews' relationship between quasi-metrics and partial metrics: an aggregation perspective
- Aggregation of asymmetric distances in computer science
- On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- A characterisation of weightable quasi-metric generating functions
- The solution of the algorithm of Divide \& Conquer using weighted complete metric spaces
- The complexity probabilistic quasi-metric space
- On aggregation of normed structures
- Some classes of distance spaces as generalized metric spaces: terminology, mappings, fixed points and applications in theoretical informatics
- The average running time of an algorithm as a midpoint between fuzzy sets
- Closed graph and open mapping theorems for normed cones
- On balancedness and D-completeness of the space of semi-Lipschitz functions
- Quotient normed cones
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389726)