arXiv (All)
open access
When Matchgate Base Collapse Fails: A Qutrit Trichotomy and Unbounded Exact Width
Holographic algorithms solve planar counting problems by encoding each value of a finite domain into several Boolean matchgate wires. Base collapse asks whether every exact representation can be compressed to a number of wires per edge bounded only by the domain size. Chen (STOC 2016) and Xia (STOC
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
- Holographic Transmission for Real-time Education and Medical Care.#334860
- A New Gap Sequence for Shellsort: RL-Driven Algorithm Discovery Beyond $N^{4/3}$#1077952
- Constraint on the total width of the Higgs boson from Higgs boson and four-top-quark measurements in pp collisions at s = 13 TeV with the ATLAS detector#1092416
- From 80x to 385x: A Best-Matching-Unit Search at the L2 Roof, Measured Against a Symmetrically Tuned Baseline#974639
- An Optimal Structure for All-Pairs Nearest Mincuts and Sensitivity Oracles for Edge Insertions#1105848
Record · ID 1154702
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