Work

Lower Bounds for Additive Complexity of Linear Operators and Bilinear Algorithms for Matrix and Polynomial Multiplication over $$GF(2)$$

Year: 2025

Type: article

Source: Mathematical Notes

DOI: 10.1134/s0001434625605143

Author: I. S. Sergeev

Institution: Research Institute "Quantum"

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W7117166125

FWCI: 0.48

Cites: 18

Cited by: 1

Related to: