On the additive complexity of GCD and LCM matrices
From MaRDI portal
Publication:509060
DOI10.1134/S0001434616070166zbMath1371.11069MaRDI QIDQ509060
Sergey B. Gashkov, Igor S. Sergeev
Publication date: 8 February 2017
Published in: Mathematical Notes (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arithmetic complexity of the Stirling transforms
- On GCD and LCM matrices
- Problems and theorems in analysis. I. Series, integral calculus, theory of functions. Transl. from the German by Dorothee Aeppli
- On Smith's determinant
- Arithmetic complexity of certain linear transformations
- Approximate formulas for some functions of prime numbers
- Handbook of Number Theory I
- On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
- Complexity of Linear Boolean Operators
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
- On the complexity of calculation of differentials and gradients
This page was built for publication: On the additive complexity of GCD and LCM matrices