Applications of the complexity space to the general probabilistic divide and conquer algorithms

DOI10.1016/J.JMAA.2008.07.026zbMath1149.68080OpenAlexW2015501313MaRDI QIDQ947570

Salvador Romaguera, Michel Schellekens, Lluís Miquel Garcia Raffi

Publication date: 6 October 2008

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2008.07.026

zbMATH Keywords

fixed pointrecurrenceSmyth completecomplexity quasi-metric spaceimproverprobabilistic divide and conquer algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (14)

A characterization of Smyth complete quasi-metric spaces via Caristi's fixed point theorem ⋮ A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application ⋮ The complexity probabilistic quasi-metric space ⋮ Weakly contractive multivalued maps and \(w\)-distances on complete quasi-metric spaces ⋮ Intrinsic approach spaces on domains ⋮ On quasi-metric aggregation functions and fixed point theorems ⋮ New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces ⋮ Complexity spaces as quantitative domains of computation ⋮ \(Q\)-functions on quasimetric spaces and fixed points for multivalued maps ⋮ The Hausdorff fuzzy quasi-metric ⋮ Fixed points of contractive maps on dcpo's ⋮ Complexity analysis via approach spaces ⋮ Identification and robustness analysis of nonlinear multi-stage enzyme-catalytic dynamical system in batch culture ⋮ On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial metric monoids and semivaluation spaces
• Cauchy sequences in quasi-pseudo-metric spaces
• C-complete quasi-uniform spaces
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• Quasi-metric properties of complexity spaces
• Left K‐Completeness in Quasi‐Metric Spaces
• The Smyth Completion
• Duality and quasi-normability for complexity spaces
• Analytic analysis of algorithms

This page was built for publication: Applications of the complexity space to the general probabilistic divide and conquer algorithms