Search papers, labs, and topics across Lattice.
1
0
6
LCL problems on trees can be solved in logarithmic time, revealing a surprising efficiency gap between deterministic and quantum-LOCAL algorithms.
