Testing in the bounded-degree graph model with degree bound two

Oded Goldreich 0001, Laliv Tauber. Testing in the bounded-degree graph model with degree bound two. Electronic Colloquium on Computational Complexity (ECCC), TR22, 2022. [doi]

Authors

Oded Goldreich 0001

This author has not been identified. Look up 'Oded Goldreich 0001' in Google

Laliv Tauber

This author has not been identified. Look up 'Laliv Tauber' in Google