On the problem of aggregation of partial T-indistinguishability operators

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we focus our attention on exploring the aggregation of partial T-indistinguishability operators (relations). Concretely we characterize, by means of (T- Tmin)-tuples, those functions that allow to merge a collection of partial T-indistinguishability operators into a single one. Moreover, we show that monotony is a necessary condition to ensure that a function aggregates partial T-indistinguishability operators into a new one. We also provide that an inter-exchange composition function condition is a sufficient condition to guarantee that a function aggregates partial T-indistinguishability operators. Finally, examples of this type of functions are also given.

Cite

CITATION STYLE

APA

Calvo Sánchez, T., Fuster-Parra, P., & Valero, Ó. (2018). On the problem of aggregation of partial T-indistinguishability operators. In Communications in Computer and Information Science (Vol. 853, pp. 207–218). Springer Verlag. https://doi.org/10.1007/978-3-319-91473-2_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free