Tokenisation is NP-Complete

In this work, we prove the NP-completeness of two variants of tokenisation, defined here as the problem of compressing a dataset to at most symbols by either finding a vocabulary directly (direct tokenisation), or selecting a sequence of merge operations (bottom-up tokenisation).

Authors

Institutions

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.acl-long.1365
Primary Topic
Embedded Systems Design Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tokenisation is NP-Complete

Gregor Bachmann, Philip A. Whittington, Tiago Pimentel
Embedded Systems Design Techniques
article

Tokenisation is NP-Complete

Gregor Bachmann, Philip A. Whittington, Tiago Pimentel
article en

Abstract

In this work, we prove the NP-completeness of two variants of tokenisation, defined here as the problem of compressing a dataset to at most symbols by either finding a vocabulary directly (direct tokenisation), or selecting a sequence of merge operations (bottom-up tokenisation).

Institute for Ethnic Studies (SI)
Openalex Percentile: Top 80%
Embedded Systems Design Techniques
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Tokenisation is NP-Complete — Gregor Bachmann, Philip A. Whittington, et al. · (2025) | TGRS Research Map | TGRS