Complexity analysis via approach spaces

DOI10.1007/s10485-013-9302-2zbMath1328.68331MaRDI QIDQ2015820

Stefan De Wachter, Michel Schellekens, Eva Lowen-Colebunders

Publication date: 24 June 2014

Published in: Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10485-013-9302-2

zbMATH Keywords

complexity; recursive algorithm; complexity approach space; fixed~point; monotone~map

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

54H25: Fixed-point and coincidence theorems (topological aspects)

54A05: Topological spaces and generalizations (closure spaces, etc.)

54B30: Categorical methods in general topology

06B35: Continuous lattices and posets, applications

Related Items

An isomorphism of the Wallman and Čech-Stone compactifications, An application of approach theory to the relative Hausdorff measure of non-compactness for the Wasserstein metric, Normality in terms of distances and contractions, Regularity for relational algebras and approach spaces

Cites Work

• Unnamed Item
• Approaching metric domains
• Distances on probability measures and random variables
• Intrinsic approach spaces on domains
• Epimorphisms and cowellpoweredness for separated metrically generated theories
• Applications of the complexity space to the general probabilistic divide and conquer algorithms
• Quasi-metric properties of complexity spaces
• Parametrized complexity theory.
• The Smyth Completion
• Continuous Lattices and Domains
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces