computational complexity

On the complexity of the optimal transport problem with graph-structured cost AISTATS 2022 On the Computational Complexity of Model Reconciliations IJCAI 2022 Overparameterization from Computational Constraints NeurIPS 2022 Participatory Budgeting with Donations and Diversity Constraints AAAI 2022 Pizza Sharing Is PPA-Hard AAAI 2022 Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States COLT 2022 Quantum perceptron revisited: Computational-statistical tradeoffs UAI 2022 Rushing and Strolling among Answer Sets – Navigation Made Easy AAAI 2022 Single-Agent Dynamics in Additively Separable Hedonic Games AAAI 2022 Sketching as a Tool for Understanding and Accelerating Self-attention for Long Sequences NAACL 2022 Statistical and computational thresholds for the planted k-densest sub-hypergraph problem AISTATS 2022 Statistical Optimality and Computational Efficiency of Nystrom Kernel PCA JMLR 2022 Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis NeurIPS 2022 The Complexity of Envy-Free Graph Cutting IJCAI 2022 The Complexity of Proportionality Degree in Committee Elections AAAI 2022 The Complexity of Subelection Isomorphism Problems AAAI 2022 Theoretically Provable Spiking Neural Networks NeurIPS 2022 Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets AAAI 2022 The Price of Selfishness: Conjunctive Query Entailment for ALCSelf Is 2EXPTIME-Hard AAAI 2022 Tight Bounds for Hybrid Planning IJCAI 2022 Understanding Distance Measures Among Elections IJCAI 2022 Voting in Two-Crossing Elections IJCAI 2022 Will Bilevel Optimizers Benefit from Loops NeurIPS 2022 A Computationally Efficient Method for Learning Exponential Family Distributions NeurIPS 2021 A Dimension-free Computational Upper-bound for Smooth Optimal Transport Estimation COLT 2021