Complexity of additive computations of systems of linear forms

DOI10.1007/BF01084394zbMath0509.68039MaRDI QIDQ1838297

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)

Related Items (2)

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

Cites Work

• An Algorithm for the Computation of Linear Forms

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