polynomial time
Polynomial time refers to the classification of an algorithm's running time that grows at a polynomial rate with respect to the input size, indicating that the algorithm is efficient and manageable within practical limits in terms of computation.
- An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
- Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies
- Differentially Private Gomory-Hu Trees
- Hadamard Test is Sufficient for Efficient Quantum Gradient Estimation with Lie Algebraic Symmetries
- Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points
- On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
- Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics
- SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism