Search papers, labs, and topics across Lattice.
1
0
Infinitely many locally checkable problems can achieve surprising round complexities in unbounded-degree graphs, challenging previous assumptions about complexity constraints.
