Sciweavers

4 search results - page 1 / 1
» Comparison of algorithms to calculate quadratic irregularity...
Sort
View
76
Voted
MOC
2002
132views more  MOC 2002»
14 years 10 months ago
Comparison of algorithms to calculate quadratic irregularity of prime numbers
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...
Joshua Holden
86
Voted
ANTS
1998
Springer
143views Algorithms» more  ANTS 1998»
15 years 3 months ago
Irregularity of Prime Numbers over Real Quadratic Fields
Joshua Holden
91
Voted
IACR
2011
128views more  IACR 2011»
13 years 10 months ago
Sign Modules in Secure Arithmetic Circuits
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...
Ching-Hua Yu
78
Voted
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 3 months ago
A Theory of Restrictions for Logics and Automata
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...
Nils Klarlund