arXiv (All)
open access
A Non-constant Lower Bound for Grammar-Based Compression with Greedy
We prove a lower bound of Ω(log n/ log log n) on the approximation ratio of the global grammar-based compression algorithm Greedy. To our knowledge, the previously best lower bound was a constant, and the existence of a nonconstant lower bound had remained open for more than twenty years. Our bound
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
- Algorithmic Structuring of Cut-free Proofs#697280
- QPACK: Field Compression for HTTP/3#502601
- Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models#987767
- Protocol Compression Changes Which Party Pays: Bilateral Cost in Cross-Organization LLM Agent Communication#973735
- Fraïssé's conjecture, partial impredicativity and well-ordering principles, part II#1070071
Record · ID 1000075
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