No article text was recorded for this version.
fixed-alphabet complexity
Version 1 of 15 papers21 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Tokenisation is NP-Complete
- Blog: Tokenisation over Bounded Alphabets is Hard
- Blog: A Partition Cover Approach to Tokenization
- Blog: Where is the signal in tokenization space?
- Blog: Top-H Decoding: Adapting the Creativity and Coherence with Bounded Entropy in Text Generation
History & citation
Current · Permanent link
- This direction split from The Computational Complexity of Optimal Tokenization (80% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_fixed_alphabet_complexity_1eadf696,
title = {fixed-alphabet complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-alphabet-complexity/rdr_1eadf696ab7344c783c054b891338144},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_fixed_alphabet_complexity_1eadf696_v1,
title = {fixed-alphabet complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-alphabet-complexity/rdr_1eadf696ab7344c783c054b891338144/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}