On the complexity of computation of a pair of monomials in two variables
From MaRDI portal
Recommendations
- On the complexity of computations on monomials and tuples of powers
- scientific article; zbMATH DE number 609921
- On the complexity of implementation of a system of two monomials by composition circuits
- Relation between two measures of the computation complexity for systems of monomials
- On Bellman's and Knuth's problems and their generalizations
Cites work
Cited in
(12)- On Bellman's and Knuth's problems and their generalizations
- On the complexity of computations on monomials and tuples of powers
- Complexity of certain systems of monomials in calculation by composition circuits
- On the complexity of implementation of a system of two monomials by composition circuits
- A simple proof for the upper bound of the computational complexity of three monomials in three variables
- Relation between two measures of the computation complexity for systems of monomials
- scientific article; zbMATH DE number 2125608 (Why is no real title available?)
- scientific article; zbMATH DE number 609921 (Why is no real title available?)
- On the complexity of calculating systems of monomials with restrictions on the powers of variables
- Some properties of vectorial addition chains†
- THE COMPLEXITY OF IMPLEMENTATION OF A SYSTEM OF MONOMIALS IN TWO VARIABLES BY COMPOSITION CIRCUITS
- 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 computation of a pair of monomials in two variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491252)