Conceptadvanced
LCP-RMQ reduction
Also called LCP as range minimum.
The LCP of two suffixes equals the minimum of the LCP array between their ranks.
The LCP of two suffixes equals the minimum of the LCP array between their ranks.
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 |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag WJ6WGX Edit this page History Report an error