186 search results - page 23 / 38 » Exceptional planar polynomials |
INDOCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosy...
INDOCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Let p be a prime and let a and c be integers modulo p. The quadratic congruential generator (QCG) is a sequence (vn) of pseudorandom numbers defined by the relation vn+1 ≡ av2 n...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Possibilistic knowledge bases gather propositional formulas associated with degrees belonging to a linearly ordered scale. These degrees reflect certainty or priority, de...
FLAIRS
2008
13 years 10 months ago
2008
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...