48 search results - page 4 / 10 » Constructing Permutation Representations for Large Matrix Gr... |
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
TC
2002
13 years 6 months ago
2002
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclo...
AAAI
2004
13 years 8 months ago
2004
We have recently proposed augmenting clauses in a Boolean database with groups of permutations, the augmented clauses then standing for the set of all clauses constructed by actin...
TITS
2008
13 years 7 months ago
2008
Arrival sequencing and scheduling (ASS) at airports is an NP-hard problem. Much effort has been made to use permutation-representation-based genetic algorithms (GAs) to tackle this...
NAA
2000
Springer
13 years 10 months ago
2000
Springer
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...