Skip to content
conftrace_

computational complexity

452 papers

Papers

Election with Bribe-Effect Uncertainty: A Dichotomy Result IJCAI 2019 Fair Knapsack AAAI 2019 Fast Spatio-Temporal Residual Network for Video Super-Resolution CVPR 2019 Generalized Distance Bribery AAAI 2019 How Hard is Robust Mean Estimation? COLT 2019 How Hard Is the Manipulative Design of Scoring Systems? IJCAI 2019 How Similar Are Two Elections? AAAI 2019 Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract) IJCAI 2019 Limit Learning Equivalence Structures ALT 2019 Moral Permissibility of Action Plans AAAI 2019 Multigoal Committee Selection IJCAI 2019 On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles IJCAI 2019 On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games AAAI 2019 On the Computational Power of Online Gradient Descent COLT 2019 On the Hardness of Robust Classification NeurIPS 2019 Sliced Gromov-Wasserstein NeurIPS 2019 Sliding Window Temporal Graph Coloring AAAI 2019 Solving Empirical Risk Minimization in the Current Matrix Multiplication Time COLT 2019 Statistical-Computational Tradeoff in Single Index Models NeurIPS 2019 The Complexity of Model Checking Knowledge and Time IJCAI 2019 The Relative Complexity of Maximum Likelihood Estimation, MAP Estimation, and Sampling COLT 2019 Unknown Agents in Friends Oriented Hedonic Games: Stability and Complexity AAAI 2019 Very Hard Electoral Control Problems AAAI 2019 What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario IJCAI 2019 Complexity of Scheduling Charging in the Smart Grid IJCAI 2018