Complexity analysis via approach spaces
type: Item
instance of: scholarly article
title: Complexity analysis via approach spaces
zbMATH Open document ID: 1328.68331
author: Stefan De Wachter
author: Eva Colebunders
author: M. Schellekens
published in: Applied Categorical Structures
publication date: 2014-06-24T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 06B35
Mathematics Subject Classification ID: 54A05
Mathematics Subject Classification ID: 54B30
Mathematics Subject Classification ID: 54H25
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6307125
zbMATH Keywords: recursive algorithm
zbMATH Keywords: complexity approach space
zbMATH Keywords: complexity
zbMATH Keywords: fixed~point
zbMATH Keywords: monotone~map
MaRDI profile type: Publication
full work available at URL: s10485-013-9302-2
OpenAlex ID: W2024588640
cites work: Applications of the complexity space to the general probabilistic divide and conquer algorithms
cites work: Distances on probability measures and random variables
cites work: Epimorphisms and cowellpoweredness for separated metrically generated theories
cites work: Intrinsic approach spaces on domains
cites work: Parametrized complexity theory.
cites work: Continuous Lattices and Domains
cites work: Approaching metric domains
cites work: Q4340906
cites work: Quasi-metric properties of complexity spaces
cites work: New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
cites work: The Smyth Completion
DOI: 10.1007/S10485-013-9302-2
description: scientific article; zbMATH DE number 6307125