polynomial time

EFX Allocation in (Multi)Hypergraphs AAAI 2026 Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition ICML 2025 Checking Consistency of CP-Theory Preferences in Polynomial Time AAAI 2025 Computational Intractability of Strategizing against Online Learners COLT 2025 Efficient and Trustworthy Causal Discovery with Latent Variables and Complex Relations ICLR 2025 Equilibria of the Colonel Blotto Games with Costs AAAI 2025 Expected Variational Inequalities ICML 2025 Learning Configurations for Data-Driven Multi-Objective Optimization ICML 2025 Learning with Exact Invariances in Polynomial Time ICML 2025 Multi-Agent Corridor Generating Algorithm IJCAI 2025 Polynomial-Time Relational Probabilistic Inference in Open Universes IJCAI 2025 Recovering Labels from Crowdsourced Data: an Optimal and Polynomial-Time Method COLT 2025 Trajectory Inference with Smooth Schrödinger Bridges ICML 2025 A faster and simpler algorithm for learning shallow networks COLT 2024 Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time ICML 2024 Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time NeurIPS 2024 Efficient Algorithms for Learning Monophonic Halfspaces in Graphs COLT 2024 Fair and Efficient Chore Allocation: Existence and Computation IJCAI 2024 Identification for Tree-Shaped Structural Causal Models in Polynomial Time AAAI 2024 No-Regret Reinforcement Learning in Smooth MDPs ICML 2024 On the Computational Benefit of Multimodal Learning ALT 2024 On the Tractability of SHAP Explanations under Markovian Distributions ICML 2024 Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem IJCAI 2024 Replicable Learning of Large-Margin Halfspaces ICML 2024 Roping in Uncertainty: Robustness and Regularization in Markov Games ICML 2024