1 Introduction
1.1 Motivation
1.2 Codes, unit fractions and more
1.3 Asymptotics
1.4 Algorithmic counting
1.5 Main result
1.6 Notes
2 Cost of the underlying operations
Task | Ring operations | Bit operations |
---|---|---|
addition | N | NM |
multiplication | \(N\log N\, 2^{O({\log ^* N})}\) | \(N\log N\, 2^{O({\log ^* N})} \cdot M\log M\) |
division | \(N\log N\, 2^{O({\log ^* N})}\) | \(N^2 M (\log N)^2 2^{O({\log ^* N})}\) |
2.1 Addition and multiplication
2.2 Power series operations
3 Cost for extracting coefficients
-
an addition (or a subtraction) of two power series by \(\textbf{A}\),
-
a multiplication of two power series by \(\textbf{M}\), and
-
a division of two power series by \(\textbf{D}\).
-
other power series operations of precision N (for example, memory allocation or writing initial values) by \(\textbf{S}\), and
-
other operations, more precisely operations of numbers with less than \(\log _2 N\) bits (for example additions of indices) by \(\textbf{O}\).