One more paper on polynomials


Added a paper “Improved n-term Karatsuba formulae in GF(2)” that contains improved (and without proof —- optimal!) formulae for multiplication of binary polynomials in GF(2). As noted in the end of this paper, the goal is not purely theoretic, but also practical —- these optimal formulae will be used for the superfast implementation of the Coppersmith algorithm (as in the work by Thome), where the key step is the multiplication of binary polynomials.


26/05/2016 A TT-eigenvalue solver that finally works Papers
12/05/2016 Exponential machines and tensor trains Papers
06/04/2016 Convergence analysis of a projected fixed-point iteration Papers
30/03/2016 Compress-and-eliminate solver for sparse matrices Papers
01/12/2015 New paper in SIMAX Papers


We are located at the 2-nd floor of the new "Technopark-3” building in Skolkovo (few kilometers outside Moscow Ring Road). The building is accessible from Skolkovo Road (Сколковское шоссе) and Minskoe Highway (Минское шоссе).