A connection between computer science and fuzzy theory: midpoints and running time of computing

zbMATH Open1163.68323MaRDI QIDQ3615892FDOQ3615892

Authors: O. Valero, Jaume Casasnovas 

Publication date: 24 March 2009

Full work available at URL: https://eudml.org/doc/42225

Recommendations

• The average running time of an algorithm as a midpoint between fuzzy sets
• Some properties and applications of fuzzy quasi-pseudo-metric spaces
• A new model based on a fuzzy quasi-metric type Baire applied to analysis of complexity
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science

zbMATH Keywords

fuzzy setsrunning time of computingcomplexity analysis of algorithms and programsmidpoints for asymmetric distances

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• The average running time of an algorithm as a midpoint between fuzzy sets
• On aggregation of normed structures
• On quasi-metric aggregation functions and fixed point theorems

This page was built for publication: A connection between computer science and fuzzy theory: midpoints and running time of computing

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