Pages that link to "Item:Q2839180"

The following pages link to Noise tolerance of expanders and sublinear expansion reconstruction (Q2839180):

Displaying 6 items.

• Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
• Local algorithms for sparse spanning graphs (Q2300722) (← links)
• Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
• Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q3387757) (← links)
• Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs (Q5890147) (← links)
• Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q6139828) (← links)