Compact representation for matrices of bounded twin-width
Abstract
For every fixed d ∈ N, we design a data structure that represents a binary n × n matrix that is d-twin-ordered. The data structure occupies Od(n) bits, which is the least one could hope for, and can be queried for entries of the matrix in time Od( n) per query.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.