On the complexity of computations on monomials and tuples of powers
From MaRDI portal
Publication:1920145
zbMath0848.68042MaRDI QIDQ1920145
Publication date: 19 August 1996
Published in: Siberian Advances in Mathematics (Search for Journal in Brave)
Related Items (3)
Comparing the computational complexity of monomials and elements of finite abelian groups ⋮ The Determinants over Associative Rings: a Definition, Properties, New Formulas and a Computational Complexity ⋮ Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
This page was built for publication: On the complexity of computations on monomials and tuples of powers
