Catalytic space enables exact multi-pass algorithms for frequency moments F_k and induced subgraph counting using O(k log m) clean space, while single-pass catalytic algorithms add no power.
Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing , pages =
4 Pith papers cite this work, alongside 227 external citations. Polarity classification is still indexing.
4
Pith papers citing it
227
external citations · external index
years
2026 4representative citing papers
Quantum-inspired estimators for F_alpha(P) and F_alpha(rho) achieve optimal sample complexity n ~ alpha and minimax MSE rate alpha/n, improving prior O(alpha^2) bounds.
Computing GapMAJ∘fⁿ requires n·(I−O(1)) bits of information, making GapMAJ the third outer gadget with a strong composition theorem in two-player communication.
TabKDE generates synthetic tabular data using copula transformations followed by kernel density estimation, matching prior accuracy with negligible training time and reduced storage via coresets.
citing papers explorer
-
Towards Minimax Estimation of High-Order Functionals by Quantum Arguments
Quantum-inspired estimators for F_alpha(P) and F_alpha(rho) achieve optimal sample complexity n ~ alpha and minimax MSE rate alpha/n, improving prior O(alpha^2) bounds.