نتایج جستجو برای: quasipermutable subgroup
تعداد نتایج: 85958 فیلتر نتایج به سال:
This paper summarizes the subgroup discovery method SUBARP. The discussion is to provide an intuitive understanding of the ideas underlying the method, and mathematical details are omitted.
Subgroup discovery is a popular form of supervised rule learning, applicable to descriptive and predictive tasks. In this work we study two natural extensions of classical subgroup discovery to distributed settings. In the first variant the goal is to efficiently identify global subgroups, i.e. the rules an analysis would yield after collecting all the data at a single central database. In cont...
In this paper we propose cryptosystems based on subgroup distortion in hyperbolic groups. We also include concrete examples of hyperbolic groups as possible platforms.
a subgroup x of a group g is said to be an h -subgroup if n_g(x) ∩ x^g ≤ x for each element g belonging to g. in [m. bianchi e. a., on finite soluble groups in which normality is a transitive relation, j. group theory, 3 (2000), 147–156] the authors showed that finite groups in which every subgroup has the h -property are exactly soluble groups in which normality is a transitive relation. here ...
In this paper, we define a generalized Wielandt subgroup, local generalized Wielandt subgroup and its series for finite group and discuss its different basic properties which explain the notion of generalized Wielandt subgroup in a better way. We bound generalized Wielandt length as a function of nilpotency classes of its Sylow subgroups.
We advocate a new approach for addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the hidden symmetry subgroup problem (HSSP), which is a generalization of the well-studied hidden subgroup problem (HSP). Given a group acting on a set and an oracle whose level sets define a partition of the set, the task is to recover the subgroup of symme...
We define and discuss symmetric subgroup membership problems and their properties, including a relation to the Decision DiffieHellman problem. We modify the Cramer-Shoup framework, so that we can derive a chosen ciphertext secure cryptosystem in the standard model from symmetric subgroup membership problems. We also discuss how chosen ciphertext secure hybrid cryptosystems based on a symmetric ...
We summarize the studies and discussions of the Structure Function subgroup of the QCD working group of the Snowmass 1996 Workshop: New Directions for High Energy Physics.
Department of Computer Science and Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland Department of Knowledge Technologies, Jožef Stefan Institute, Ljubljana, Slovenia International Postgraduate School Jožef Stefan, Ljubljana, Slovenia Department of Biotechnology and Systems Biology, National Institute of Biology, Ljubljana, Slovenia Email: {laura.langohr, hannu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید