computational complexity

A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem AAAI 2021 An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections AAAI 2021 Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models IJCAI 2021 Choice Logics and Their Computational Properties IJCAI 2021 Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021 Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty AAAI 2021 Dynamic Grained Encoder for Vision Transformers NeurIPS 2021 Efficient Attention: Attention With Linear Complexities WACV 2021 Equitable Scheduling on a Single Machine AAAI 2021 Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules IJCAI 2021 Exact Optimization of Conformal Predictors via Incremental and Decremental Learning ICML 2021 Extendability of causal graphical models: Algorithms and computational complexity UAI 2021 Fractional Matchings under Preferences: Stability and Optimality IJCAI 2021 Generalized parametric path problems UAI 2021 Grid-Functioned Neural Networks ICML 2021 Guaranteeing Maximin Shares: Some Agents Left Behind IJCAI 2021 How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements IJCAI 2021 Improved Complexity Bounds in Wasserstein Barycenter Problem AISTATS 2021 Interference-free Walks in Time: Temporally Disjoint Paths IJCAI 2021 Kemeny Consensus Complexity IJCAI 2021 Knowledge-Base Degrees of Inconsistency: Complexity and Counting AAAI 2021 Learning a mixture of two subspaces over finite fields ALT 2021 Luna: Linear Unified Nested Attention NeurIPS 2021 Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom AAAI 2021 On Robust Optimal Transport: Computational Complexity and Barycenter Computation NeurIPS 2021