4 search results - page 1 / 1 » Comparison of algorithms to calculate quadratic irregularity... |
MOC
2002
13 years 4 months ago
2002
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
IACR
2011
12 years 4 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
CAV
1999
Springer
13 years 9 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...