scientific article; zbMATH DE number 3934403

MaRDI QIDQ3706499zbMATH OpenFDO

Authors Edouard G. Belaga

Publication date 1985

zbMATH Keywords

category of algorithmsLinear straight-line algorithmslower bound to the linear-size-complexity of a linear transform over a field

Mathematics Subject Classification ID

Linear transformations, semilinear transformations (15A04) Graphs, diagram schemes, precategories (18A10) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Recommendations

• The arithmetic computational complexity of linear transforms
• scientific article; zbMATH DE number 3345166
• scientific article; zbMATH DE number 3988701
• Linear Circuits over $\operatorname{GF}(2)$
• On complexity of linear operators on the class of circuits of depth 2

Cited in

(4)

• Bilinear mincing rank
• The arithmetic computational complexity of linear transforms
• scientific article; zbMATH DE number 3345166 (Why is no real title available?)
• Constructive universal algebra: An introduction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706499)