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.
Proceedings of the 58th ACM Symposium on Theory of Computing , pages =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
ACCEPT 2representative citing papers
Under Gap-ETH, the n^{O(1/ε^{d-1})}-time shifting PTAS is optimal for maximum independent set, minimum dominating set, maximum induced forest, maximum induced matching, and minimum piercing set on unit ball graphs in every constant dimension d≥2.
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.
-
Shifting is Optimal under Gap-ETH: A Lower Bound Framework for Geometric Approximation Schemes
Under Gap-ETH, the n^{O(1/ε^{d-1})}-time shifting PTAS is optimal for maximum independent set, minimum dominating set, maximum induced forest, maximum induced matching, and minimum piercing set on unit ball graphs in every constant dimension d≥2.