Dynamic connectivity lower bounds

Also called Dynamic connectivity lower bound, Patrascu-Demaine connectivity bound, Patrascu-Demaine lower bounds, logarithmic lower bounds for dynamic connectivity.

Logarithmic lower bounds in the cell-probe model for dynamic connectivity-type problems.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

Ladder	Level	What the next level needs
Human proof	H0 no proof	add a proof in proofs/ (06.5)
Lean	L0 no Lean part	name a Lean module in the lean field (07)
Visual	V0 none	add viz/scene.ts or a figure (10)
Writing	W0 stub	Statement one source with a locator

Tag QGCV7H Edit this page History Report an error