Complexity of additive computations of systems of linear forms

DOI10.1007/BF01084394MaRDI QIDQ1838297zbMATH OpenFDO

Authors Alexander Sidorenko

Publication date 1983

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

algebraic complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Matrices of integers (15B36)

Cites work

• An Algorithm for the Computation of Linear Forms

Cited in

(2)

• Comparing the computational complexity of monomials and elements of finite abelian groups
• On Bellman's and Knuth's problems and their generalizations

This page was built for publication: Complexity of additive computations of systems of linear forms

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