arXiv (All)
open access
An Operator Approach to Register Programs for Catalytic Computing
In a seminal work, Buhrman et al.\ (STOC 2014) introduced catalytic computation and proved that uniform $TC^1$ circuits are computable in catalytic logspace, the class of problems solvable in space $s$ with an additional catalytic tape of size $c$, a tape whose initial content must be restored at th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quantifying Nonstabilizerness of Quantum Codes by Removing the Inert Background#973778
- 42 U.S.C. § 19084 — Advanced computing#588349
- Applicability of a Stateful Path Computation Element (PCE)#502846
- Skill Issue: Lessons from Optimizing Repository SKILLs for Coding Agents#1070213
- Applicability of the Path Computation Element (PCE) to the Abstraction and Control of TE Networks (ACTN)#213505
Record · ID 1012863
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive