Study Finds NP‑Hardness of ROABP Order Finding and Equivalence

Researchers proved that finding ROABP ordering and testing GL_n equivalence are NP‑hard even for quadratic forms, and that approximating minimal width is also NP‑hard. Submitted September 2025. getnews.me/study-finds-np-hardness-... #roabp #nphard