Conceptio › Archive › arXiv (All)
arXiv (All)open access

An Elementary Proof of the $\widetilde O(n^{1/3})$ Bound for Separating Words

Xu, Chen
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
combinatoricscomputational-complexity
formal languages and automata theory, computational complexity, combinatorics
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 985567
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.