923 search results - page 44 / 185 » On a generalization of Stickelberger's Theorem |
113
click to vote
CSFW
2005
IEEE
15 years 7 months ago
2005
IEEE
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
127
click to vote
FCT
1999
Springer
15 years 6 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
105
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
There are several studies on the desirable properties that a performance measure for evolutionary multiobjective algorithms must have. One of these properties is called “compati...
JCT
2008
15 years 1 months ago
2008
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
115
click to vote
TOCL
2008
15 years 1 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...