434 search results - page 71 / 87 » Monadic Bounded Algebras |
SACRYPT
1999
Springer
14 years 2 months ago
1999
Springer
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m . We call these sequences elliptic curve...
ANTS
2010
Springer
14 years 1 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
CIE
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
ECSQARU
1995
Springer
14 years 1 months ago
1995
Springer
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
FLOPS
2008
Springer
13 years 11 months ago
2008
Springer
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...