Complexity of additive computations of systems of linear forms
From MaRDI portal
Publication:1838297
DOI10.1007/BF01084394zbMath0509.68039MaRDI QIDQ1838297
Publication date: 1983
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
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
This page was built for publication: Complexity of additive computations of systems of linear forms