Internal structure of addition chains: well-ordering
From MaRDI portal
Publication:1704595
DOI10.1016/j.tcs.2017.12.002zbMath1422.11012arXiv1409.1627OpenAlexW2963952883MaRDI QIDQ1704595
Publication date: 12 March 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.1627
Related Items (2)
Uses Software
Cites Work
- Calculating optimal addition chains
- Integer complexity and well-ordering
- The Scholz-Brauer problem in addition chains
- A lower bound for the length of addition chains
- The Scholz-Brauer problem on addition chains
- On addition chains \(l(mn)\leq 1 (n)-b\) and lower bounds for c(r)
- Zum Scholz-Brauerschen Problem.
- Lower Bounds for Lucas Chains
- Numbers with Integer Complexity Close to the Lower Bound
- A Lower Bound for the Scholz-Brauer Problem
- Arithmetic of ordinals with applications to the theory of ordered Abelian groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Internal structure of addition chains: well-ordering