The average running time of an algorithm as a midpoint between fuzzy sets

DOI10.1016/J.MCM.2008.08.003MaRDI QIDQ732662zbMATH OpenOpenAlexFDO

Authors Pedro Tirado, O. Valero

Publication date 12 October 2009

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2008.08.003

zbMATH Keywords

fuzzy setrunning time of computingmidpointasymmetric distanceweighted maximum distance

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Analysis of algorithms (68W40) General topics in the theory of algorithms (68W01)

Recommendations

• A connection between computer science and fuzzy theory: midpoints and running time of computing
• A new model based on a fuzzy quasi-metric type Baire applied to analysis of complexity
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• scientific article; zbMATH DE number 6026956
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces

Cites work

• scientific article; zbMATH DE number 994051 (Why is no real title available?)
• scientific article; zbMATH DE number 5002607 (Why is no real title available?)
• scientific article; zbMATH DE number 107486 (Why is no real title available?)
• scientific article; zbMATH DE number 1735963 (Why is no real title available?)
• scientific article; zbMATH DE number 1978322 (Why is no real title available?)
• scientific article; zbMATH DE number 1784847 (Why is no real title available?)
• scientific article; zbMATH DE number 2147519 (Why is no real title available?)
• scientific article; zbMATH DE number 6026956 (Why is no real title available?)
• A fuzzy closeness approach to fuzzy multi-attribute decision making
• Averaging fuzzy biopolymers
• Crisp and soft computing with hypercubical calculus. New approaches to modeling in cognitive science and technology with parity logic, fuzzy logic, and evolutionary computing
• Definition of general aggregation operators through similarity relations
• Denotational semantics for programming languages, balanced quasi-metrics and fixed points
• Difference Equations
• Distance and similarity measures for fuzzy operators
• Fuzzy mathematics in medicine
• Fuzzy submonoids, fuzzy preorders and quasi-metrics
• Quasi-metric properties of complexity spaces
• Representation theorems for fuzzy orders and quasi-metrics
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• Some similarity measures of intuitionistic fuzzy sets and their applications to multiple attribute decision making
• The Complexity of Tree Automata and Logics of Programs
• The Smyth Completion
• The complexity space of a valued linearly ordered set
• The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances

Cited in

(8)

• A characterization of Smyth complete quasi-metric spaces via Caristi's fixed point theorem
• Discussion on definitions for similarity measures of intuitionistic fuzzy sets
• Conjugate families of mappings in pointwise metric fuzzy lattices
• Aggregation of asymmetric distances in computer science
• On aggregation of normed structures
• On quasi-metric aggregation functions and fixed point theorems
• Averaging fuzzy biopolymers
• A connection between computer science and fuzzy theory: midpoints and running time of computing

This page was built for publication: The average running time of an algorithm as a midpoint between fuzzy sets

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