arXiv (All)
open access
Practical Linear-Time Computation of Smallest Suffixient Sets
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
- Practical Linear-Time Computation of Smallest Suffixient Sets#664334
- Asymptotically unit-rate storage codes from binary BCH codes#1157004
- The Inverse Lyndon Array#1049142
- Lower Bounds for all List-Decodable Deletion Codes#1062537
- A Triadic Suffix Tokenization Scheme for Numerical Reasoning#10351
Record · ID 665834
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