Skip to content
conftrace_

computational complexity

452 papers

Papers

How Hard Is It to Impact the Impact of Your Paper? IJCAI 2024 How to Make Knockout Tournaments More Popular? AAAI 2024 Imperfect-Recall Games: Equilibrium Concepts and Their Complexity IJCAI 2024 Improved statistical and computational complexity of the mean-field Langevin dynamics under structured data ICLR 2024 Improving Computational Complexity in Statistical Models with Local Curvature Information ICML 2024 Individual Rationality in Topological Distance Games Is Surprisingly Hard IJCAI 2024 Instantiations and Computational Aspects of Non-Flat Assumption-based Argumentation IJCAI 2024 Learning Causal Dynamics Models in Object-Oriented Environments ICML 2024 Learning from higher-order correlations, efficiently: hypothesis tests, random features, and neural networks NeurIPS 2024 Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis AAAI 2024 Linear Log-Normal Attention with Unbiased Concentration ICLR 2024 Local vs. Global Interpretability: A Computational Complexity Perspective ICML 2024 Matching the Statistical Query Lower Bound for k-Sparse Parity Problems with Sign Stochastic Gradient Descent NeurIPS 2024 Maxileximin Envy Allocations and Connected Goods AAAI 2024 MemoryFormer : Minimize Transformer Computation by Removing Fully-Connected Layers NeurIPS 2024 Multi-Winner Reconfiguration NeurIPS 2024 Natural Language Satisfiability: Exploring the Problem Distribution and Evaluating Transformer-based Language Models ACL 2024 NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes ACL 2024 On Computational Limits of Modern Hopfield Models: A Fine-Grained Complexity Analysis ICML 2024 On the Complexity of Identification in Linear Structural Causal Models NeurIPS 2024 On the Computational Benefit of Multimodal Learning ALT 2024 On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence AAAI 2024 On the Empirical Complexity of Reasoning and Planning in LLMs EMNLP 2024 Open problem: Direct Sums in Learning Theory COLT 2024 Optimal Parallelization of Boosting NeurIPS 2024