Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) (Q947669): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2008.06.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999900513 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4314299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4094392 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4364562 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal evaluation of pairs of bilinear forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Five, six, and seven-term Karatsuba-like formulae / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5676984 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gaussian elimination is not optimal / rank | |||
Normal rank |
Latest revision as of 17:59, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) |
scientific article |
Statements
Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) (English)
0 references
6 October 2008
0 references
Given some field \(F\) and a known bilinear form belonging to \(F,\) the construction of optimal algorithms for computing such a bilinear form enjoys a large literature. Here the author chooses \(F\) to be the \(GF(2)\), the field with only two elements, and presents several combinatorial approaches for finding optimal Karatsuba-like formulae for fast computing of certain bilinear forms in \(GF(2)\). Two exhaustive search algorithms are proposed which exploit an explicit construction of trilinear decompositions. All considered examples are symmetric but results about non-symmetric case are promised in a separate paper.
0 references
optimal algorithms
0 references
Karatsuba
0 references
polynomial multiplication
0 references
trilinear decomposition
0 references