Pages that link to "Item:Q1964592"
From MaRDI portal
The following pages link to A sublinear bipartiteness tester for bounded degree graphs (Q1964592):
Displaying 41 items.
- Small complete minors above the extremal edge density (Q313429) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Testing the expansion of a graph (Q963057) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- A lower bound for testing juntas (Q2390270) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
- On Testing Expansion in Bounded-Degree Graphs (Q3088177) (← links)
- On the Average-Case Complexity of Property Testing (Q3088183) (← links)
- A Brief Introduction to Property Testing (Q3088197) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Another Motivation for Reducing the Randomness Complexity of Algorithms (Q3088202) (← 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)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- Testing Expansion in Bounded-Degree Graphs (Q4911108) (← links)
- A Brief Introduction to Property Testing (Q4933359) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- (Q5002727) (← links)
- (Q5090414) (← links)
- Flexible Models for Testing Graph Properties (Q5098784) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← 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)
- Fast distributed algorithms for testing graph properties (Q5915702) (← 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)
