arXiv (All)open access
A Non-constant Lower Bound for Grammar-Based Compression with Greedy
data structures and algorithms, formal languages and automata theory
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1000075
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.