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

DOI10.1016/J.JMAA.2008.07.026MaRDI QIDQ947570zbMATH OpenOpenAlexFDO

Authors Lluís Miquel García Raffi, Salvador Romaguera, M. Schellekens

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)

Recommendations

• The complexity probabilistic quasi-metric space
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• scientific article; zbMATH DE number 1258313
• Complexity analysis via approach spaces
• Application of fixed point theorem in probabilistic metric space to quicksort algorithm

Cites work

• scientific article; zbMATH DE number 4212991 (Why is no real title available?)
• scientific article; zbMATH DE number 4094358 (Why is no real title available?)
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 554487 (Why is no real title available?)
• scientific article; zbMATH DE number 1101628 (Why is no real title available?)
• scientific article; zbMATH DE number 1784847 (Why is no real title available?)
• Analytic analysis of algorithms
• C-complete quasi-uniform spaces
• Cauchy sequences in quasi-pseudo-metric spaces
• Duality and quasi-normability for complexity spaces
• Left K‐Completeness in Quasi‐Metric Spaces
• Partial metric monoids and semivaluation spaces
• Quasi-metric properties of complexity spaces
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• The Smyth Completion
• The dual complexity space as the dual of a normed cone

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947570)