computational complexity

Cryptographic Hardness of Learning Halfspaces with Massart Noise NeurIPS 2022 DiRe Committee : Diversity and Representation Constraints in Multiwinner Elections IJCAI 2022 Efficient Learning of CNNs using Patch Based Features ICML 2022 Efficient Training of Audio Transformers with Patchout Interspeech 2022 Equilibria in Strategic Nominee Selection IJCAI 2022 Equivalence in Argumentation Frameworks with a Claim-Centric View – Classical Results with Novel Ingredients AAAI 2022 Explaining Preferences by Multiple Patterns in Voters’ Behavior IJCAI 2022 Fixing Knockout Tournaments With Seeds IJCAI 2022 Hedonic Games with Fixed-Size Coalitions AAAI 2022 Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit NeurIPS 2022 Incomplete Argumentation Frameworks: Properties and Complexity AAAI 2022 Individual Representation in Approval-Based Committee Voting AAAI 2022 Insight into Voting Problem Complexity Using Randomized Classes IJCAI 2022 Instance-Aware Dynamic Neural Network Quantization CVPR 2022 Learning Strides in Convolutional Neural Networks ICLR 2022 Learning (Very) Simple Generative Models Is Hard NeurIPS 2022 Low-rank Optimal Transport: Approximation, Statistics and Debiasing NeurIPS 2022 Manipulating Elections by Changing Voter Perceptions IJCAI 2022 Maxmin Participatory Budgeting IJCAI 2022 Monotone Abstractions in Ontology-Based Data Management AAAI 2022 Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules IJCAI 2022 On Computing Probabilistic Explanations for Decision Trees NeurIPS 2022 On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity AISTATS 2022 On the Complexity of Calculating Approval-Based Winners in Candidates-Embedded Metrics IJCAI 2022 On the Complexity of Inductively Learning Guarded Clauses AAAI 2022