300 search results - page 1 / 60 » An extension of the Cayley-Sylvester formula |
EJC
2007
13 years 4 months ago
2007
Abstract. We extend the Cayley-Sylvester formula for symmetric powers of SL2(C)modules, to plethysms defined by rectangle partitions. Ordinary partitions are replaced by plane par...
JAPLL
2010
13 years 3 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
FUZZIEEE
2007
IEEE
13 years 11 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
EUROCRYPT
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
DIS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper, first we introduce minimal and closed monotone DNF formulas as extensions of maximal and closed itemsets. Next, by incorporating the algorithm dnf cover d...