Preprint
Jul 2026
Costs of Arbitrary Real Matrix Factorizations for Pure-DP Continual Counting
The theorem below establishes the order for arbitrary real factors under the factorization contract of Arkhipov and Kalinin, who prove the matching lower order for factors with entries in $\{0,1\}$ and state the arbitrary-factor extension as open.
Awnon Bhowmik, Mahmudul Hasan
· 1 citation
· ⚡1