polynomial time algorithm

Breaking the 1/√n Barrier: Faster Rates for Permutation-based Models in Polynomial Time COLT 2018 Computational Approaches for Stochastic Shortest Path on Succinct MDPs IJCAI 2018 Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games IJCAI 2018 Finding Minimal Separators in LWF Chain Graphs PGM 2018 Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers NAACL 2018 Maximin Share Allocations on Cycles IJCAI 2018 Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis RSS 2018 Practical exact algorithm for trembling-hand equilibrium refinements in games NeurIPS 2018 Spectral Filtering for General Linear Dynamical Systems NeurIPS 2018 Unary Integer Linear Programming with Structural Restrictions IJCAI 2018 Being Robust (in High Dimensions) Can Be Practical ICML 2017 Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networks NeurIPS 2017 Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity NeurIPS 2017 On the Learnability of Fully-Connected Neural Networks AISTATS 2017 Recognizing Top-Monotonic Preference Profiles in Polynomial Time IJCAI 2017 Efficient Globally Optimal 2D-To-3D Deformable Shape Matching CVPR 2016 Optimal Sparse Linear Encoders and Sparse PCA NeurIPS 2016 A Spatiotemporal Optimal Stopping Problem for Mission Monitoring with Stationary Viewpoints RSS 2015 Learning Mixtures of Ranking Models NeurIPS 2014 Lower Bounds on the Performance of Polynomial-time Algorithms for Sparse Linear Regression COLT 2014 Provable Submodular Minimization using Wolfe's Algorithm NeurIPS 2014 Tighten after Relax: Minimax-Optimal Sparse PCA in Polynomial Time NeurIPS 2014 Efficient Learning of Simplices COLT 2013 A Polynomial-time Form of Robust Regression NeurIPS 2012 Minimum Average Cost Clustering NeurIPS 2010