On Bellman's and Knuth's problems and their generalizations
From MaRDI portal
Publication:1791767
DOI10.1007/s10958-018-3928-4zbMath1484.68073OpenAlexW2810868986WikidataQ129607548 ScholiaQ129607548MaRDI QIDQ1791767
Publication date: 11 October 2018
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-018-3928-4
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Number-theoretic algorithms; complexity (11Y16)
Related Items (3)
On the computation complexity of the systems of finite abelian group elements ⋮ A simple proof for the upper bound of the computational complexity of three monomials in three variables ⋮ Comparing the computational complexity of monomials and elements of finite abelian groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal word chains for the Thue-Morse word
- Some results on addition/subtraction chains
- A lower bound for the length of addition chains
- Complexity of additive computations of systems of linear forms
- On addition computations for systems of integral linear forms
- Relation between two measures of the computation complexity for systems of monomials
- Berechnungen in partiellen Algebren endlichen Typs
- On the computation of powers sets
- Addition Chain Methods for the Evaluation of Specific Polynomials
- On the Evaluation of Powers and Monomials
- Computing Sequences with Addition Chains
- On vectorial addition chains
- On the Evaluation of Powers
- The minimum number of edges in graphs with prescribed paths
- A Survey of Fast Exponentiation Methods
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
- On the complexity of computation of a pair of monomials in two variables
- Remarks on number theory III. On addition chains
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
- On addition chains
This page was built for publication: On Bellman's and Knuth's problems and their generalizations
