Co-occurring keywords · papers mentioning both
Papers
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
IJCAI 2020
On the Hardness of Probabilistic Inference Relaxations
AAAI 2019
Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT
IJCAI 2019
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms
ICML 2017
On the Complexity of Learning Neural Networks
NeurIPS 2017
A Novel Relationship Between Dynamics and Complexity in Multi-agent Collision Avoidance
RSS 2016
Variable Selection is Hard
COLT 2015
Lower Bounds on the Performance of Polynomial-time Algorithms for Sparse Linear Regression
COLT 2014
Open Problem: Online Local Learning
COLT 2014
Competition Adds Complexity
NeurIPS 2007