Pith. sign in

REVIEW

Compact representation for matrices of bounded twin-width

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.08106 v1 pith:VPVI4WYQ submitted 2021-10-15 cs.DS

Compact representation for matrices of bounded twin-width

Micha{\l} Pilipczuk , Marek Soko{\l}owski , Anna Zych-Pawlewicz This is my paper
classification cs.DS
keywords datamatrixstructurebinarybitsboundedcompactdesign
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

For every fixed $d \in \mathbb{N}$, we design a data structure that represents a binary $n \times n$ matrix that is $d$-twin-ordered. The data structure occupies $O_d(n)$ bits, which is the least one could hope for, and can be queried for entries of the matrix in time $O_d(\log \log n)$ per query.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.