Beyond the Alder-Strassen boundBLÄSER, Markus.Theoretical computer science. 2005, Vol 331, Num 1, pp 3-21, issn 0304-3975, 19 p.Conference Paper

On the additive complexity of 2 × 2 matrix multiplicationBSHOUTY, N. H.Information processing letters. 1995, Vol 56, Num 6, pp 329-335, issn 0020-0190Article

MULTIPLICATIVE COMPLEXITY OF SOME RATIONAL FUNCTIONSHARTMANN W; SCHUSTER P.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 53-61; BIBL. 2 REF.Article

The multiplicative complexity of discrete cosine transformsFEIG, E; LINZER, E.Advances in applied mathematics (Print). 1992, Vol 13, Num 4, pp 494-503, issn 0196-8858Article

Multiplication of polynomials modulo xⁿCENK, Murat; ÖZBUDAK, Ferruh.Theoretical computer science. 2011, Vol 412, Num 29, pp 3451-3462, issn 0304-3975, 12 p.Article

On the multiplicative complexity of Boolean functions over the basis (Λ, ○+, 1)BOYAR, J; PERALTA, R; POCHUEV, D et al.Theoretical computer science. 2000, Vol 235, Num 1, pp 43-57, issn 0304-3975Article

Representing small indentically self-dual matroids by self-dual codesPADRO, Carles; GRACIA, Ignacio.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 4, pp 1046-1055, issn 0895-4801, 10 p.Article

Tight bounds for the multiplicative complexity of symmetric functionsBOYAR, Joan; PERALTA, René.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 223-246, issn 0304-3975, 24 p.Article

The complexity of bivariate power series arithmeticBLÄSER, Markus.Theoretical computer science. 2003, Vol 295, Num 1-3, pp 65-83, issn 0304-3975, 19 p.Conference Paper