Results 1  10
of
5,143
Structures on QFuzzy Left NSubgroups of Near Rings under Triangular Norms
"... In this paper, we introduce the notion of QFuzzification of left NSubgroups in a near ring and investigate some related properties, characterization of QFuzzy left NSubgroups with respect to a triangular norm are given. ..."
Abstract
 Add to MetaCart
In this paper, we introduce the notion of QFuzzification of left NSubgroups in a near ring and investigate some related properties, characterization of QFuzzy left NSubgroups with respect to a triangular norm are given.
SProduct of Anti QFuzzy Left MN Subgroups of Near Rings under Triangular Conorms
"... In this paper, we introduce the notion of Q fuzzification of left MN subgroups in a nearring and investigate some related properties. Characterization of Anti Q fuzzy left MN subgroups with respect to snorm is given. ..."
Abstract
 Add to MetaCart
In this paper, we introduce the notion of Q fuzzification of left MN subgroups in a nearring and investigate some related properties. Characterization of Anti Q fuzzy left MN subgroups with respect to snorm is given.
Symplectic S¹ × N³, subgroup separability, and vanishing Thurston norm
, 2007
"... Let N be a closed, oriented 3–manifold. A folklore conjecture states that S 1 × N admits a symplectic structure if and only if N admits a fibration over the circle. We will prove this conjecture in the case when N is irreducible and its fundamental group satisfies appropriate subgroup separability c ..."
Abstract
 Add to MetaCart
Let N be a closed, oriented 3–manifold. A folklore conjecture states that S 1 × N admits a symplectic structure if and only if N admits a fibration over the circle. We will prove this conjecture in the case when N is irreducible and its fundamental group satisfies appropriate subgroup separability
Subgroup
"... Abstract�In this paper we examine some properties of suborbital graphs for the congruence subgroup � 0 ( N). Then we give necessary and sufficient conditions for graphs to have triangels. ..."
Abstract
 Add to MetaCart
Abstract�In this paper we examine some properties of suborbital graphs for the congruence subgroup � 0 ( N). Then we give necessary and sufficient conditions for graphs to have triangels.
Linear Regression Limit Theory for Nonstationary Panel Data
 ECONOMETRICA
, 1999
"... This paper develops a regression limit theory for nonstationary panel data with large numbers of cross section Ž n. and time series Ž T. observations. The limit theory allows for both sequential limits, wherein T� � followed by n��, and joint limits where T, n�� simultaneously; and the relationship ..."
Abstract

Cited by 312 (22 self)
 Add to MetaCart
This paper develops a regression limit theory for nonstationary panel data with large numbers of cross section Ž n. and time series Ž T. observations. The limit theory allows for both sequential limits, wherein T� � followed by n��, and joint limits where T, n�� simultaneously; and the relationship
On Subgroups
"... Let HU,y be a pseudonatural group. A central problem in pure axiomatic Galois theory is the characterization of multiplicative lines. We show that Λ ̄ is globally ndimensional. A useful survey of the subject can be found in [31]. The goal of the present paper is to classify vectors. 1 ..."
Abstract
 Add to MetaCart
Let HU,y be a pseudonatural group. A central problem in pure axiomatic Galois theory is the characterization of multiplicative lines. We show that Λ ̄ is globally ndimensional. A useful survey of the subject can be found in [31]. The goal of the present paper is to classify vectors. 1
Maximal subgroups of finite groups
 J. Algebra
, 1985
"... What ingredients are necessary to describe all maximal subgroups of the general analysis. finite group G? This paper is concerned with providing such an A good first reduction is to take into account the first isomorphism theorem, which tells us that the maximal subgroups containing a given normal s ..."
Abstract

Cited by 60 (5 self)
 Add to MetaCart
subgroup N of G correspond, under the natural projection, to the maximal subgroups of the quotient group G/N. Let PZ = PQ denote the collection of maximal subgroups of G, and let e * be the subset of those ME?)z with Ker,(M) = 1, where Ker,(M) denotes the largest normal subgroup of G contained in M
A new publickey cryptosystem as secure as factoring
 In Eurocrypt '98, LNCS 1403
, 1998
"... Abstract. This paper proposes a novel publickey cryptosystem, which is practical, provably secure and has some other interesting properties as follows: 1. Its trapdoor technique is essentially different from any other previous schemes including RSARabin and DiffieHellman. 2. It is a probabilistic ..."
Abstract

Cited by 208 (7 self)
 Add to MetaCart
probabilistic encryption scheme. 3. It can be proven to be as secure as the intractability of factoring n = p 2 q (in the sense of the security of the whole plaintext) against passive adversaries. 4. It is semantically secure under the psubgroup assumption, which is comparable to the quadratic residue
Cryptography in subgroups of Z*n
 PROCEEDINGS OF TCC 2005, LNCS
, 2005
"... We demonstrate the cryptographic usefulness of a small subgroup of Z ∗ n of hidden order. Cryptographic schemes for integer commitment and digital signatures have been suggested over large subgroups of Z ∗ n, by reducing the order of the groups we obtain quite similar but more efficient schemes. T ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We demonstrate the cryptographic usefulness of a small subgroup of Z ∗ n of hidden order. Cryptographic schemes for integer commitment and digital signatures have been suggested over large subgroups of Z ∗ n, by reducing the order of the groups we obtain quite similar but more efficient schemes
Cryptography in subgroups of Z ∗ n
 In proceedings of TCC ’05, LNCS series
, 2005
"... Abstract. We demonstrate the cryptographic usefulness of a small subgroup of Z ∗ n of hidden order. Cryptographic schemes for integer commitment and digital signatures have been suggested over large subgroups of Z ∗ n, by reducing the order of the groups we obtain quite similar but more efficient sc ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. We demonstrate the cryptographic usefulness of a small subgroup of Z ∗ n of hidden order. Cryptographic schemes for integer commitment and digital signatures have been suggested over large subgroups of Z ∗ n, by reducing the order of the groups we obtain quite similar but more efficient
Results 1  10
of
5,143