scientific article; zbMATH DE number 609921
From MaRDI portal
Publication:4301392
zbMath0849.68055MaRDI QIDQ4301392
Sergey B. Gashkov, Vadim V. Kochergin
Publication date: 21 February 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity and performance of numerical algorithms (65Y20)
Related Items (9)
Rectifier Circuits of Bounded Depth ⋮ On some measures of complexity of finite abelian groups ⋮ On the computation complexity of the systems of finite abelian group elements ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ Relation between two measures of the computation complexity for systems of monomials ⋮ Comparing the computational complexity of monomials and elements of finite abelian groups ⋮ Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems ⋮ Arithmetic complexity of certain linear transformations ⋮ The arithmetic computational complexity of linear transforms
This page was built for publication:
