Want to create an interactive transcript for this episode?
Podcast: Arxiv Papers
Episode: Tokenisation is NP-Complete
Description:
This paper proves the NP-completeness of two tokenisation variants: direct tokenisation, which finds a vocabulary, and bottom-up tokenisation, which selects merge operations for dataset compression.
https://arxiv.org/abs//2412.15210
YouTube: https://www.youtube.com/@ArxivPapers
TikTok: https://www.tiktok.com/@arxiv_papers
Apple Podcasts: https://podcasts.apple.com/us/podcast/arxiv-papers/id1692476016
Spotify: https://podcasters.spotify.com/pod/show/arxiv-papers