Pages that link to "Item:Q1964592"
From MaRDI portal
The following pages link to A sublinear bipartiteness tester for bounded degree graphs (Q1964592):
Displayed 4 items.
- \(\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)
- Testing hypergraph colorability (Q1770424) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)