Computing Polynomials with Few Multiplications
16 Sept 2011 Key words and phrases: arithmetic circuits multiplications. 1 Introduction. Arithmetic complexity is a branch of theoretical computer ...
AdderNet: Do We Really Need Multiplications in Deep Learning?
In this paper we present adder networks (AdderNets) to trade these massive multiplications in deep neural networks
On the Arithmetic Complexity of Strassen-Like Matrix Multiplications
The Strassen algorithm for multiplying 2 × 2 matrices requires seven multiplications and 18 additions. The recursive use of this algorithm for matrices of
Profinite Braid Groups Galois Representations and Complex
1-adic power series for complex multiplications of Fermat type or equivalently
Galois Action on Division Points of Abelian Varieties with Real
Suppose that X has no complex multiplication (i.e. EndcX= Z). Then the image of p.
Lecture 11 – Fast matrix multiplication
16 Jun 2014 373.) 1.4 Boolean matrix multiplication. Strassen's algorithm uses not only additions and multiplications so as to multiply matrices but also ...
Witnesses for Boolean Matrix Multiplication and for Shortest Paths
We use O(n?) to denote the running time of some subcubic algorithm for Boolean matrix multiplication. All our algorithms can be derived from any such algorithm
A NONCOMMUTATIVE ALGORITHM FOR MULTIPLYING 3 x 3
The standard definition for the multiplication of two n x n matrices yields a noncommutative algorithm using n3 multiplications. Strassen [7] produced a.
Double-Base Chains for Scalar Multiplications on Elliptic Curves
Keywords: Elliptic curve cryptography Scalar multiplication
Fast Secure Matrix Multiplications over Ring-Based Homomorphic
HElib is a software library that implements the Brakerski-Gentry-Vaikuntanathan (BGV) homomorphic scheme in which secure matrix-vector multiplication is
