On the complexity of computations on monomials and tuples of powers

MaRDI QIDQ1920145zbMATH OpenFDO

Authors Vadim V. Kochergin

Publication date 19 August 1996

Published in Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexitycomputationchain

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Sequences and sets (11B99)

Recommendations

• On the complexity of calculating systems of monomials with restrictions on the powers of variables
• On the complexity of computation of a pair of monomials in two variables
• scientific article; zbMATH DE number 4045141
• The complexity of monotone computations of polynomials
• Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems
• scientific article; zbMATH DE number 4033074
• scientific article; zbMATH DE number 2125608
• On the complexity of powering in finite fields
• Complexity of certain systems of monomials in calculation by composition circuits
• On the complexity of the computation of certain classes of polynomials of several variables

Cited in

(11)

• Complexity of certain systems of monomials in calculation by composition circuits
• On the complexity of computation of a pair of monomials in two variables
• scientific article; zbMATH DE number 4033074 (Why is no real title available?)
• A simple proof for the upper bound of the computational complexity of three monomials in three variables
• THE COMPLEXITY OF IMPLEMENTATION OF A SYSTEM OF MONOMIALS IN TWO VARIABLES BY COMPOSITION CIRCUITS
• The Determinants over Associative Rings: a Definition, Properties, New Formulas and a Computational Complexity
• scientific article; zbMATH DE number 2125608 (Why is no real title available?)
• Comparing the computational complexity of monomials and elements of finite abelian groups
• On Bellman's and Knuth's problems and their generalizations
• scientific article; zbMATH DE number 609921 (Why is no real title available?)
• 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

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