polynomial-time algorithm
An algorithm whose running time is a polynomial function of the size of its input. In AI, polynomial-time algorithms are desirable for their efficiency as they scale better than exponential-time algorithms, aiming for feasible computation on large datasets.
- A Principled Approach to Randomized Selection under Uncertainty: Applications to Peer Review and Grant Funding
- Assignments for Congestion-Averse Agents: Seeking Competitive and Envy-Free Solutions
- Efficient $k$-Sparse Band–Limited Interpolation with Improved Approximation Ratio
- Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
- Low-degree evidence for computational transition of recovery rate in stochastic block model
- Non-rectangular Robust MDPs with Normed Uncertainty Sets