Co-occurring keywords · papers mentioning both
Papers
Circuit Complexity Bounds for RoPE-based Transformer Architecture
EMNLP 2025
Computing Game Symmetries and Equilibria That Respect Them
AAAI 2025
Inapproximability of Optimal Multi-Agent Pathfinding Problems
AAAI 2025
Intelligence at the Edge of Chaos
ICLR 2025
Limits of Deep Learning: Sequence Modeling through the Lens of Complexity Theory
ICLR 2025
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
ICLR 2025
Tokenisation is NP-Complete
ACL 2025
Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning
ICLR 2025
An Approximate Skolem Function Counter
AAAI 2024
Auditable Algorithms for Approximate Model Counting
AAAI 2024
Revisiting Causal Discovery from a Complexity-Theoretic Perspective
IJCAI 2024
Solving Quantified Boolean Formulas with Few Existential Variables
IJCAI 2024
Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey
IJCAI 2023
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity
AAAI 2023
Not all Strongly Rayleigh Distributions Have Small Probabilistic Generating Circuits
ICML 2023
Pseudointelligence: A Unifying Lens on Language Model Evaluation
EMNLP 2023
On the Complexity of Inductively Learning Guarded Clauses
AAAI 2022
A Complexity-theoretic Analysis of Green Pickup-and-Delivery Problems
AAAI 2021
A Theory of the Risk for Optimization with Relaxation and its Application to Support Vector Machines
JMLR 2021
Choosing the Right Algorithm With Hints From Complexity Theory
IJCAI 2021
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable
AAAI 2021
On the Complexity of Sum-of-Products Problems over Semirings
AAAI 2021
Unconstrained MAP Inference, Exponentiated Determinantal Point Processes, and Exponential Inapproximability
AISTATS 2021
Unitary Branching Programs: Learnability and Lower Bounds
ICML 2021
Model Interpretability through the lens of Computational Complexity
NeurIPS 2020