Skip to content
conftrace_

computational complexity

452 papers

Papers

On the Approximation of Nash Equilibria in Sparse Win-Lose Multi-player Games AAAI 2021 On the Complexity of Finding Justifications for Collective Decisions AAAI 2021 On the Tractability of SHAP Explanations AAAI 2021 Outside Computation with Superior Functions NAACL 2021 Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework AAAI 2021 Participatory Budgeting with Project Groups IJCAI 2021 Persuading Voters in District-based Elections AAAI 2021 Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning IJCAI 2021 Proportional Representation under Single-Crossing Preferences Revisited AAAI 2021 Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility AAAI 2021 Recursive prosody is not finite-state ACL 2021 Searching for More Efficient Dynamic Programs EMNLP 2021 Source Identification for Mixtures of Product Distributions COLT 2021 Stochastic $L^\natural$-convex Function Minimization NeurIPS 2021 Stochastic model for sunk cost bias UAI 2021 Stratified Negation in Datalog with Metric Temporal Operators AAAI 2021 Strong Explanations in Abstract Argumentation AAAI 2021 Targeted Negative Campaigning: Complexity and Approximations AAAI 2021 The Complexity Landscape of Claim-Augmented Argumentation Frameworks AAAI 2021 The Complexity of Sparse Tensor PCA NeurIPS 2021 The Smoothed Complexity of Computing Kemeny and Slater Rankings AAAI 2021 Training Neural Networks is ER-complete NeurIPS 2021 Triple M: A Practical Text-to-Speech Synthesis System with Multi-Guidance Attention and Multi-Band Multi-Time LPCNet Interspeech 2021 Video Question Answering Using Language-Guided Deep Compressed-Domain Video Feature ICCV 2021 Winner Determination and Strategic Control in Conditional Approval Voting IJCAI 2021