computational complexity

Optimal Continual Learning has Perfect Memory and is NP-hard ICML 2020 Participatory Budgeting with Project Interactions IJCAI 2020 Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud AAAI 2020 Revisiting the Notion of Extension over Incomplete Abstract Argumentation Frameworks IJCAI 2020 Structural Decompositions of Epistemic Logic Programs AAAI 2020 The Complexity of Computing Maximin Share Allocations on Graphs AAAI 2020 The Complexity of Election Problems with Group-Separable Preferences IJCAI 2020 The Computational Complexity of Angry Birds (Extended Abstract) IJCAI 2020 The Gradient Complexity of Linear Regression COLT 2020 Time-Inconsistent Planning: Simple Motivation Is Hard to Find AAAI 2020 Tractable Fragments of Datalog with Metric Temporal Operators IJCAI 2020 Training Linear Neural Networks: Non-Local Convergence and Complexity Results ICML 2020 A Contribution to the Critique of Liquid Democracy IJCAI 2019 Adversarial examples from computational constraints ICML 2019 A Framework for Approval-Based Budgeting Methods AAAI 2019 Answer Set Programming for Judgment Aggregation IJCAI 2019 A Survey on Hierarchical Planning – One Abstract Idea, Many Concrete Realizations IJCAI 2019 Complexity Bounds for the Controllability of Temporal Networks with Conditions, Disjunctions, and Uncertainty (Extended Abstract) IJCAI 2019 Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract) IJCAI 2019 Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting IJCAI 2019 Computational Aspects of Equilibria in Discrete Preference Games IJCAI 2019 Computational Separations between Sampling and Optimization NeurIPS 2019 Correlating Preferences and Attributes: Nearly Single-Crossing Profiles IJCAI 2019 DatalogMTL: Computational Complexity and Expressive Power IJCAI 2019 Efficient Neural Network Compression CVPR 2019