Papers

• The Expressive Power of Low Precision Softmax Transformers with (Summarized) Chain-of-Thought (2026)
  Moritz Br\"osamle et al.
  1.83
• AgentDoG: A Diagnostic Guardrail Framework for AI Agent Safety and Security (2026)
  Dongrui Liu et al.
  1.61
• Reasoning About Knowledge on Regular Expressions is 2EXPTIME-complete (2025)
  Avijeet Ghosh et al.
  1.33
• On the complexity of constrained reconfiguration and motion planning (2025)
  Nicolas Bousquet et al.
  1.33
• Training Cross-Morphology Embodied AI Agents: From Practical Challenges to Theoretical Foundations (2025)
  Shaoshan Liu et al.
  1.22
• Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems (2025)
  Poria Azadi
  1.17
• Value Iteration with Guessing for Markov Chains and Markov Decision Processes (2025)
  Krishnendu Chatterjee and Mahdi JafariRaviz and Raimundo Saona and Jakub Svoboda
  1.17
• Multi-Agent Path Finding For Large Agents Is Intractable (2025)
  Artem Agafonov et al.
  1.17
• Combinatorics of a Discrete Trajectory Space for Robot Motion Planning (2020)
  Felix Wiebe and Shivesh Kumar and Daniel Harnack and Malte Langosz and Hendrik W\"ohrle and Frank Kirchner
  —
• Walking through Doors is Hard, even without Staircases: Universality and PSPACE-hardness of Planar Door Gadgets (2020)
  MIT Gadgets Group et al.
  —
• On Two-Handed Planar Assembly Partitioning with Connectivity Constraints (2020)
  Pankaj K. Agarwal et al.
  —
• Mixed-Integer Linear Programming Models for Multi-Robot Non-Adversarial Search (2020)
  Beatriz A. Asfora et al.
  —
• Characterizing Universal Reconfigurability of Modular Pivoting Robots (2020)
  Hugo A. Akitaya et al.
  —
• NIPM-HLSP: An Efficient Interior-Point Method for Hierarchical Least-Squares Programs (2021)
  Kai Pfeiffer et al.
  —
• Towards a Framework for Comparing the Complexity of Robotic Tasks (2022)
  Michelle Ho and Alec Farid and Anirudha Majumdar
  —
• Expressivity of Planning with Horn Description Logic Ontologies (Technical Report) (2022)
  Stefan Borgwardt et al.
  —
• Environmental Sensing Options for Robot Teams: A Computational Complexity Perspective (2022)
  Todd Wareham and Andrew Vardy
  —
• Computational complexity reduction of deep neural networks (2022)
  Mee Seong Im et al.
  —
• Minimizing Running Buffers for Tabletop Object Rearrangement: Complexity, Fast Algorithms, and Applications (2023)
  Kai Gao et al.
  —
• ActionReasoningBench: Reasoning about Actions with and without Ramification Constraints (2024)
  Divij Handa et al.
  —