Saved in:
| Main Author: | Nye, Logan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.00607 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
$\mathrm{TIME}[t]\subseteq \mathrm{SPACE}[O(\sqrt{t})]$ via Tree Height Compression
by: Nye, Logan
Published: (2025)
by: Nye, Logan
Published: (2025)
The Computational Boundary of Inference: Capability Internalization, Training, and the Turing Jump
by: Lu, Chien-Ping
Published: (2026)
by: Lu, Chien-Ping
Published: (2026)
Categorical Construction of Logically Verifiable Neural Architectures
by: Nye, Logan
Published: (2025)
by: Nye, Logan
Published: (2025)
The Computational Complexity of Circuit Discovery for Inner Interpretability
by: Adolfi, Federico, et al.
Published: (2024)
by: Adolfi, Federico, et al.
Published: (2024)
Linear Equations with Min and Max Operators: Computational Complexity
by: Chatterjee, Krishnendu, et al.
Published: (2024)
by: Chatterjee, Krishnendu, et al.
Published: (2024)
On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
by: Li, Xiaoyu, et al.
Published: (2025)
by: Li, Xiaoyu, et al.
Published: (2025)
Efficient Inference and Computation of Optimal Alternatives for Preference Languages Based On Lexicographic Models
by: Wilson, Nic, et al.
Published: (2024)
by: Wilson, Nic, et al.
Published: (2024)
Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models
by: Hu, Jerry Yao-Chieh, et al.
Published: (2024)
by: Hu, Jerry Yao-Chieh, et al.
Published: (2024)
Looped ReLU MLPs May Be All You Need as Practical Programmable Computers
by: Liang, Yingyu, et al.
Published: (2024)
by: Liang, Yingyu, et al.
Published: (2024)
Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems
by: Azadi, Poria
Published: (2025)
by: Azadi, Poria
Published: (2025)
Computability of Agentic Systems
by: Viriyasuthee, Chatavut
Published: (2026)
by: Viriyasuthee, Chatavut
Published: (2026)
Forgetting in short and heterogeneous sequences of belief revisions
by: Liberatore, Paolo
Published: (2025)
by: Liberatore, Paolo
Published: (2025)
Value Iteration with Guessing for Markov Chains and Markov Decision Processes
by: Chatterjee, Krishnendu, et al.
Published: (2025)
by: Chatterjee, Krishnendu, et al.
Published: (2025)
The Limits of Tractable Marginalization
by: Broadrick, Oliver, et al.
Published: (2025)
by: Broadrick, Oliver, et al.
Published: (2025)
Structure-Aware Encodings of Argumentation Properties for Clique-width
by: Mahmood, Yasir, et al.
Published: (2025)
by: Mahmood, Yasir, et al.
Published: (2025)
Complexity Results of Persuasion
by: Grastien, Alban
Published: (2025)
by: Grastien, Alban
Published: (2025)
Training Cross-Morphology Embodied AI Agents: From Practical Challenges to Theoretical Foundations
by: Liu, Shaoshan, et al.
Published: (2025)
by: Liu, Shaoshan, et al.
Published: (2025)
Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy
by: Ganian, Robert, et al.
Published: (2025)
by: Ganian, Robert, et al.
Published: (2025)
A Quantale-Weakness Route to $P \neq NP$ via CD Evidence Normalization and Gauge-Buffered Locked Ensembles
by: Goertzel, Ben
Published: (2025)
by: Goertzel, Ben
Published: (2025)
Solving Multiagent Path Finding on Highly Centralized Networks
by: Fioravantes, Foivos, et al.
Published: (2024)
by: Fioravantes, Foivos, et al.
Published: (2024)
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
by: Asadi, Ali, et al.
Published: (2026)
by: Asadi, Ali, et al.
Published: (2026)
Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
by: Eriksson, Leif, et al.
Published: (2026)
by: Eriksson, Leif, et al.
Published: (2026)
Over the Edge of Chaos? Excess Complexity as a Roadblock to Artificial General Intelligence
by: Susnjak, Teo, et al.
Published: (2024)
by: Susnjak, Teo, et al.
Published: (2024)
CSPs with Few Alien Constraints
by: Jonsson, Peter, et al.
Published: (2024)
by: Jonsson, Peter, et al.
Published: (2024)
Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
by: Goertzel, Ben, et al.
Published: (2026)
by: Goertzel, Ben, et al.
Published: (2026)
Probabilistic Generating Circuits -- Demystified
by: Agarwal, Sanyam, et al.
Published: (2024)
by: Agarwal, Sanyam, et al.
Published: (2024)
From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
by: Dörfler, Julian, et al.
Published: (2024)
by: Dörfler, Julian, et al.
Published: (2024)
Parameterized Complexity Of Representing Models Of MSO Formulas
by: Kučera, Petr, et al.
Published: (2026)
by: Kučera, Petr, et al.
Published: (2026)
An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
by: Fargier, Hélène, et al.
Published: (2021)
by: Fargier, Hélène, et al.
Published: (2021)
Complexity of Scheduling Charging in the Smart Grid
by: de Weerdt, Mathijs, et al.
Published: (2017)
by: de Weerdt, Mathijs, et al.
Published: (2017)
Diversity of Extensions in Abstract Argumentation
by: Fichte, Johannes K., et al.
Published: (2026)
by: Fichte, Johannes K., et al.
Published: (2026)
A Structural Complexity Analysis of Hierarchical Task Network Planning
by: Brand, Cornelius, et al.
Published: (2024)
by: Brand, Cornelius, et al.
Published: (2024)
ActionReasoningBench: Reasoning about Actions with and without Ramification Constraints
by: Handa, Divij, et al.
Published: (2024)
by: Handa, Divij, et al.
Published: (2024)
Solving Quantified Boolean Formulas with Few Existential Variables
by: Eriksson, Leif, et al.
Published: (2024)
by: Eriksson, Leif, et al.
Published: (2024)
Social Distancing Induced Coronavirus Optimization Algorithm (COVO): Application to Multimodal Function Optimization and Noise Removal
by: Varma, Om Ramakisan, et al.
Published: (2024)
by: Varma, Om Ramakisan, et al.
Published: (2024)
Probabilistic Explanations for Linear Models
by: Subercaseaux, Bernardo, et al.
Published: (2024)
by: Subercaseaux, Bernardo, et al.
Published: (2024)
Explaining Decisions in ML Models: a Parameterized Complexity Analysis
by: Ordyniak, Sebastian, et al.
Published: (2024)
by: Ordyniak, Sebastian, et al.
Published: (2024)
Turing Completeness and Sid Meier's Civilization
by: de Wynter, Adrian
Published: (2021)
by: de Wynter, Adrian
Published: (2021)
The Complexity of Symmetry Breaking Beyond Lex-Leader
by: Anders, Markus, et al.
Published: (2024)
by: Anders, Markus, et al.
Published: (2024)
On the Complexity of Identification in Linear Structural Causal Models
by: Dörfler, Julian, et al.
Published: (2024)
by: Dörfler, Julian, et al.
Published: (2024)
Similar Items
-
$\mathrm{TIME}[t]\subseteq \mathrm{SPACE}[O(\sqrt{t})]$ via Tree Height Compression
by: Nye, Logan
Published: (2025) -
The Computational Boundary of Inference: Capability Internalization, Training, and the Turing Jump
by: Lu, Chien-Ping
Published: (2026) -
Categorical Construction of Logically Verifiable Neural Architectures
by: Nye, Logan
Published: (2025) -
The Computational Complexity of Circuit Discovery for Inner Interpretability
by: Adolfi, Federico, et al.
Published: (2024) -
Linear Equations with Min and Max Operators: Computational Complexity
by: Chatterjee, Krishnendu, et al.
Published: (2024)