Show all results sharing this subject:
1 Assuming that appropriate ordering relations exist on the domain A and the codomain B of the function f: A → B, then f is said to be monotonic if for all a in A and b in B for which a ≤ b then f(a) ≤ f(b).
2 See weakening.
A Dictionary of Computing »
See all related items in Oxford Index »
Search for the text `monotonic' anywhere in Oxford Index »
Users without a subscription are not able to see the full content. Please,
or login to access all content.
Forgot your password?