نتایج جستجو برای: set intersection representation
تعداد نتایج: 875114 فیلتر نتایج به سال:
Abstract Private set intersection (PSI) allows two mutually distrusting parties each with a as input, to learn the of both their sets without revealing anything more about respective input sets. Traditionally, PSI studies static setting where computation is performed only once on parties’ We initiate study updatable private (UPSI), which compute regular basis that also constantly get updated. c...
Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...
the application of a comprehensive model of communicative language ability (cla) to language teaching and testing has always been an imperative in l2 education since hymess proposal of communicative competence in the 1970s. recent l2 research has clearly underscored the importance of sufficient pragmatics representation as an essential component of cla in pedagogical and testing practices in l2...
in this paper, we introduce the notion of primal strong co-ideals and give some results involving them. it is shown thatsubtractive strong co-ideals are intersection of all primal strong co-ideals that contain them. also we prove that the representation of strong co-ideals as reduced intersections of primal strong co-ideals is unique.
In this paper, we introduce the notion of primal strong co-ideals and give some results involving them. It is shown thatsubtractive strong co-ideals are intersection of all primal strong co-ideals that contain them. Also we prove that the representation of strong co-ideals as reduced intersections of primal strong co-ideals is unique.
Every lattice is isomorphic to a lattice whose elements are sets of sets and whose operations are intersection and the operation ∨∗ defined by A ∨∗ B = A ∪ B ∪ {Z : (∃X ∈ A)(∃Y ∈ B)X ∩ Y ⊆ Z}. This representation spells out precisely Birkhoff’s and Frink’s representation of arbitrary lattices, which is related to Stone’s set-theoretic representation of distributive lattices. (AMS Subject Classi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید