conftrace_

polynomial time

67 papers

Explore in graph

Also known as

P

Co-occurring keywords

computational complexity (399) polynomial time algorithm (55) fair division (158) combinatorial optimization (1039) graphical model (864) approximation algorithm (630) relu activation (93) decision tree (322) neural network (6616) nash equilibrium (398)

Papers

Reforming an Envy-Free Matching AAAI 2022
Theoretically Provable Spiking Neural Networks NIPS 2022
Linear tree shap NIPS 2022
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time ALT 2021
Explanations for Monotonic Classifiers. ICML 2021
Trembling-Hand Perfection and Correlation in Sequential Games AAAI 2021
Efficient PAC Reinforcement Learning in Regular Decision Processes IJCAI 2021
PROPm Allocations of Indivisible Goods to Multiple Agents IJCAI 2021
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning IJCAI 2021
Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis AAAI 2021
Faster and Better Simple Temporal Problems AAAI 2021
Wasserstein barycenters can be computed in polynomial time in fixed dimension JMLR 2021
Better Algorithms for Estimating Non-Parametric Models in Crowd-Sourcing and Rank Aggregation COLT 2020
ID3 Learns Juntas for Smoothed Product Distributions COLT 2020
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay NIPS 2020
Inverting Deep Generative models, One layer at a time NIPS 2019
Can Adversarially Robust Learning LeverageComputational Hardness? ALT 2019
Learning Two Layer Rectified Neural Networks in Polynomial Time COLT 2019
Evolving Solutions to Community-Structured Satisfiability Formulas AAAI 2019
Exact inference in structured prediction NIPS 2019
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings IJCAI 2018
Learning linear structural equation models in polynomial time and sample complexity AISTATS 2018
Lower Bounds for Higher-Order Convex Optimization COLT 2018
Learning Maximum-A-Posteriori Perturbation Models for Structured Prediction in Polynomial Time ICML 2018
Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract) IJCAI 2018