610 search results - page 3 / 122 » Fast Modular Reduction |
CSR
2009
Springer
14 years 25 days ago
2009
Springer
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC0 ◦MODm circuits. We show that the following ...
DATE
2008
IEEE
14 years 22 days ago
2008
IEEE
ARITH
2007
IEEE
14 years 18 days ago
2007
IEEE
ENTCS
2002
13 years 6 months ago
2002
MOC
2011
13 years 1 months ago
2011
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...