no code implementations • 15 Feb 2021 • Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld
We then prove that no that algorithm with sub-constant error given probe access to random $d$-regular graphs can have runtime better than $\Omega(\sqrt{n}/\log(n))$ per query in expectation, obtaining a nearly matching lower bound.
Data Structures and Algorithms
